/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:52:14,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:52:14,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:52:14,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:52:14,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:52:14,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:52:14,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:52:14,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:52:14,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:52:14,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:52:14,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:52:14,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:52:14,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:52:14,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:52:14,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:52:14,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:52:14,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:52:14,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:52:14,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:52:14,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:52:14,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:52:14,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:52:14,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:52:14,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:52:14,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:52:14,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:52:14,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:52:14,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:52:14,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:52:14,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:52:14,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:52:14,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:52:14,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:52:14,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:52:14,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:52:14,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:52:14,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:52:14,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:52:14,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:52:14,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:52:14,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:52:14,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:52:14,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:52:14,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:52:14,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:52:14,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:52:14,942 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:52:14,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:52:14,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:52:14,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:52:14,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:52:14,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:52:14,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:52:14,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:52:14,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:14,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:52:14,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:52:14,945 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 00:52:15,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:52:15,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:52:15,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:52:15,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:52:15,237 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:52:15,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_power.i [2022-12-13 00:52:16,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:52:16,485 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:52:16,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_power.i [2022-12-13 00:52:16,499 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f73fd6d9/87fafe8ecfad46ccb4864c119ff19c69/FLAG3fac7234b [2022-12-13 00:52:16,511 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f73fd6d9/87fafe8ecfad46ccb4864c119ff19c69 [2022-12-13 00:52:16,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:52:16,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:52:16,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:16,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:52:16,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:52:16,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:16,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a502f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16, skipping insertion in model container [2022-12-13 00:52:16,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:16,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:52:16,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:52:16,671 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/safe020_power.i[990,1003] [2022-12-13 00:52:16,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:16,846 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:52:16,862 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/safe020_power.i[990,1003] [2022-12-13 00:52:16,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:16,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:16,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:16,946 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:52:16,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16 WrapperNode [2022-12-13 00:52:16,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:16,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:16,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:52:16,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:52:16,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:16,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,016 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-12-13 00:52:17,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:17,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:52:17,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:52:17,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:52:17,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,053 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:52:17,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:52:17,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:52:17,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:52:17,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (1/1) ... [2022-12-13 00:52:17,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:17,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:52:17,113 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 00:52:17,123 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 00:52:17,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:52:17,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:52:17,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:52:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:52:17,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:52:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:52:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:52:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:52:17,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:52:17,150 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 00:52:17,316 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:52:17,322 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:52:17,658 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:52:17,925 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:52:17,926 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:52:17,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:17 BoogieIcfgContainer [2022-12-13 00:52:17,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:52:17,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:52:17,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:52:17,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:52:17,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:52:16" (1/3) ... [2022-12-13 00:52:17,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdf38a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:17, skipping insertion in model container [2022-12-13 00:52:17,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:16" (2/3) ... [2022-12-13 00:52:17,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdf38a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:17, skipping insertion in model container [2022-12-13 00:52:17,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:17" (3/3) ... [2022-12-13 00:52:17,935 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-12-13 00:52:17,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:52:17,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:52:17,948 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:52:18,004 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:52:18,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 00:52:18,077 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 00:52:18,077 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:18,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:52:18,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 00:52:18,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-12-13 00:52:18,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:18,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2022-12-13 00:52:18,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2022-12-13 00:52:18,159 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 00:52:18,159 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:18,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:52:18,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2022-12-13 00:52:18,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-13 00:52:27,716 INFO L241 LiptonReduction]: Total number of compositions: 104 [2022-12-13 00:52:27,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:52:27,737 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;@7032a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:52:27,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:52:27,747 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 00:52:27,747 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:27,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:27,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:52:27,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash 839293739, now seen corresponding path program 1 times [2022-12-13 00:52:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:27,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654047585] [2022-12-13 00:52:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:28,093 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 00:52:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654047585] [2022-12-13 00:52:28,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654047585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:28,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:28,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064987977] [2022-12-13 00:52:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:28,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:28,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:28,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 00:52:28,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:28,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:28,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 00:52:28,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:29,732 INFO L130 PetriNetUnfolder]: 7924/12173 cut-off events. [2022-12-13 00:52:29,732 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 00:52:29,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23575 conditions, 12173 events. 7924/12173 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 80985 event pairs, 2218 based on Foata normal form. 0/7271 useless extension candidates. Maximal degree in co-relation 23564. Up to 9597 conditions per place. [2022-12-13 00:52:29,767 INFO L137 encePairwiseOnDemand]: 54/58 looper letters, 32 selfloop transitions, 2 changer transitions 52/95 dead transitions. [2022-12-13 00:52:29,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 374 flow [2022-12-13 00:52:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-12-13 00:52:29,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:52:29,779 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 125 flow. Second operand 3 states and 116 transitions. [2022-12-13 00:52:29,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 374 flow [2022-12-13 00:52:29,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 95 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:52:29,783 INFO L231 Difference]: Finished difference. Result has 65 places, 30 transitions, 70 flow [2022-12-13 00:52:29,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=65, PETRI_TRANSITIONS=30} [2022-12-13 00:52:29,787 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2022-12-13 00:52:29,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:29,788 INFO L89 Accepts]: Start accepts. Operand has 65 places, 30 transitions, 70 flow [2022-12-13 00:52:29,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:29,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:29,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 30 transitions, 70 flow [2022-12-13 00:52:29,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 00:52:29,795 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 00:52:29,796 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:29,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:52:29,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 00:52:29,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 00:52:29,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:29,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 00:52:29,970 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 00:52:29,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:29,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:29,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:29,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:52:29,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:29,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1328208302, now seen corresponding path program 1 times [2022-12-13 00:52:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:29,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237783803] [2022-12-13 00:52:29,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:30,201 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 00:52:30,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:30,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237783803] [2022-12-13 00:52:30,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237783803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:30,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:30,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:30,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109876727] [2022-12-13 00:52:30,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:30,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:30,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:30,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:30,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 00:52:30,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 00:52:30,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:30,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 00:52:30,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:30,528 INFO L130 PetriNetUnfolder]: 1371/2149 cut-off events. [2022-12-13 00:52:30,528 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-13 00:52:30,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 2149 events. 1371/2149 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10444 event pairs, 403 based on Foata normal form. 10/1799 useless extension candidates. Maximal degree in co-relation 4355. Up to 1942 conditions per place. [2022-12-13 00:52:30,539 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 00:52:30,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 172 flow [2022-12-13 00:52:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 00:52:30,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:52:30,540 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 60 transitions. [2022-12-13 00:52:30,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 172 flow [2022-12-13 00:52:30,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:52:30,542 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 85 flow [2022-12-13 00:52:30,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-13 00:52:30,542 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -28 predicate places. [2022-12-13 00:52:30,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:30,543 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 85 flow [2022-12-13 00:52:30,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:30,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:30,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 85 flow [2022-12-13 00:52:30,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 85 flow [2022-12-13 00:52:30,548 INFO L130 PetriNetUnfolder]: 3/44 cut-off events. [2022-12-13 00:52:30,549 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:30,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 44 events. 3/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 124 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2022-12-13 00:52:30,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 85 flow [2022-12-13 00:52:30,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-13 00:52:30,560 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:30,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 00:52:30,561 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 85 flow [2022-12-13 00:52:30,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 00:52:30,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:30,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:30,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:52:30,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1775218162, now seen corresponding path program 1 times [2022-12-13 00:52:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:30,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903374511] [2022-12-13 00:52:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:30,733 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 00:52:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:30,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903374511] [2022-12-13 00:52:30,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903374511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:30,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:30,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:30,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632628154] [2022-12-13 00:52:30,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:30,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:30,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:30,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:52:30,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:30,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:30,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:52:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:30,991 INFO L130 PetriNetUnfolder]: 1165/1914 cut-off events. [2022-12-13 00:52:30,991 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-12-13 00:52:30,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4076 conditions, 1914 events. 1165/1914 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9532 event pairs, 279 based on Foata normal form. 20/1613 useless extension candidates. Maximal degree in co-relation 4065. Up to 1382 conditions per place. [2022-12-13 00:52:31,001 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 30 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2022-12-13 00:52:31,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 172 flow [2022-12-13 00:52:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 00:52:31,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2022-12-13 00:52:31,002 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 85 flow. Second operand 3 states and 59 transitions. [2022-12-13 00:52:31,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 172 flow [2022-12-13 00:52:31,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:31,004 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 90 flow [2022-12-13 00:52:31,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 00:52:31,004 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -26 predicate places. [2022-12-13 00:52:31,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:31,004 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 90 flow [2022-12-13 00:52:31,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:31,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:31,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 90 flow [2022-12-13 00:52:31,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 90 flow [2022-12-13 00:52:31,011 INFO L130 PetriNetUnfolder]: 3/44 cut-off events. [2022-12-13 00:52:31,012 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:52:31,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 44 events. 3/44 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2022-12-13 00:52:31,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 90 flow [2022-12-13 00:52:31,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 00:52:31,013 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:31,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 00:52:31,014 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 90 flow [2022-12-13 00:52:31,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:31,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:31,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:31,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:52:31,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:31,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1202515496, now seen corresponding path program 1 times [2022-12-13 00:52:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:31,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73813269] [2022-12-13 00:52:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:32,374 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 00:52:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73813269] [2022-12-13 00:52:32,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73813269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:32,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:32,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:52:32,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137600014] [2022-12-13 00:52:32,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:32,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:52:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:32,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:52:32,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:52:32,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 00:52:32,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:32,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:32,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 00:52:32,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:32,770 INFO L130 PetriNetUnfolder]: 1247/2035 cut-off events. [2022-12-13 00:52:32,771 INFO L131 PetriNetUnfolder]: For 579/579 co-relation queries the response was YES. [2022-12-13 00:52:32,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4496 conditions, 2035 events. 1247/2035 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10353 event pairs, 352 based on Foata normal form. 49/1746 useless extension candidates. Maximal degree in co-relation 4483. Up to 1466 conditions per place. [2022-12-13 00:52:32,782 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 45 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2022-12-13 00:52:32,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 273 flow [2022-12-13 00:52:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:52:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:52:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 00:52:32,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2022-12-13 00:52:32,783 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 90 flow. Second operand 5 states and 97 transitions. [2022-12-13 00:52:32,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 273 flow [2022-12-13 00:52:32,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:52:32,786 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 139 flow [2022-12-13 00:52:32,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 00:52:32,786 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2022-12-13 00:52:32,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:32,787 INFO L89 Accepts]: Start accepts. Operand has 47 places, 38 transitions, 139 flow [2022-12-13 00:52:32,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:32,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:32,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 139 flow [2022-12-13 00:52:32,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 139 flow [2022-12-13 00:52:32,823 INFO L130 PetriNetUnfolder]: 99/243 cut-off events. [2022-12-13 00:52:32,824 INFO L131 PetriNetUnfolder]: For 135/150 co-relation queries the response was YES. [2022-12-13 00:52:32,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 243 events. 99/243 cut-off events. For 135/150 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1239 event pairs, 43 based on Foata normal form. 2/170 useless extension candidates. Maximal degree in co-relation 527. Up to 138 conditions per place. [2022-12-13 00:52:32,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 139 flow [2022-12-13 00:52:32,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-13 00:52:33,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L799: Formula: (and (= v_~x$r_buff0_thd2~0_77 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_293 256) 0)) (not (= (mod v_~x$w_buff1_used~0_275 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_137 v_~x$r_buff1_thd3~0_131) (= v_~x$w_buff0~0_162 1) (= v_~x$w_buff0~0_163 v_~x$w_buff1~0_153) (= v_~x$r_buff1_thd1~0_78 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0_used~0_294 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0_used~0_293 1) (= v_~x$r_buff1_thd2~0_60 v_~x$r_buff0_thd2~0_78) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_80 v_~x$r_buff0_thd0~0_70)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_163, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_162, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_131, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_78, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [687] L760-->L778: Formula: (let ((.cse8 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse6 (= (mod v_~x$r_buff1_thd1~0_53 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_204 256) 0)) (.cse15 (= (mod v_~x$r_buff0_thd1~0_56 256) 0))) (let ((.cse1 (= (mod v_~weak$$choice2~0_64 256) 0)) (.cse7 (not .cse15)) (.cse9 (not .cse16)) (.cse0 (select |v_#memory_int_203| |v_~#x~0.base_136|)) (.cse10 (and .cse6 .cse15)) (.cse12 (and .cse15 .cse8))) (let ((.cse4 (or .cse10 .cse16 .cse12)) (.cse3 (select .cse0 |v_~#x~0.offset_136|)) (.cse5 (and .cse7 .cse9)) (.cse2 (not .cse1)) (.cse14 (= 0 (mod v_~x$w_buff1_used~0_187 256))) (.cse11 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= (store |v_#memory_int_203| |v_~#x~0.base_136| (store .cse0 |v_~#x~0.offset_136| |v_P0_#t~ite10_33|)) |v_#memory_int_202|) (or (and (= v_~__unbuffered_p0_EAX~0_14 |v_P0_#t~mem9_32|) .cse1 (= |v_P0_#t~ite10_33| |v_P0_#t~mem9_32|)) (and (= |v_P0Thread1of1ForFork2_#t~mem9_1| |v_P0_#t~mem9_32|) .cse2 (= |v_P0_#t~ite10_33| v_~x$mem_tmp~0_30))) (= .cse3 v_~x$mem_tmp~0_30) (= v_~x$w_buff0_used~0_203 (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse4 v_~x$w_buff0_used~0_204 (ite .cse5 0 v_~x$w_buff0_used~0_204)))) (or (and .cse4 (= v_~__unbuffered_p0_EAX~0_14 |v_P0_#t~mem6_34|) (= .cse3 |v_P0_#t~mem6_34|)) (and (or (not .cse6) .cse7) (= v_~__unbuffered_p0_EAX~0_14 (ite .cse5 v_~x$w_buff0~0_93 v_~x$w_buff1~0_88)) (= |v_P0Thread1of1ForFork2_#t~mem6_1| |v_P0_#t~mem6_34|) (or (not .cse8) .cse7) .cse9)) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_58) (= v_~x$w_buff1~0_88 v_~x$w_buff1~0_87) (= v_~x$flush_delayed~0_50 0) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_64) (= v_~x$w_buff0~0_93 v_~x$w_buff0~0_92) (= (ite .cse2 v_~x$w_buff1_used~0_188 (ite (or .cse10 .cse11 .cse12) v_~x$w_buff1_used~0_188 0)) v_~x$w_buff1_used~0_187) (= (ite .cse2 v_~x$r_buff1_thd1~0_53 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_55 256) 0))) (or (and .cse13 .cse14) (and .cse6 .cse13) .cse11)) v_~x$r_buff1_thd1~0_53 0)) v_~x$r_buff1_thd1~0_52) (= v_~x$r_buff0_thd1~0_55 (ite .cse2 v_~x$r_buff0_thd1~0_56 (ite (or .cse10 (and .cse15 .cse14) .cse11) v_~x$r_buff0_thd1~0_56 (ite (and .cse7 (not .cse11)) 0 v_~x$r_buff0_thd1~0_56)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~#x~0.offset=|v_~#x~0.offset_136|, ~x$w_buff1~0=v_~x$w_buff1~0_88, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_53, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_1|, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204, #memory_int=|v_#memory_int_203|, ~#x~0.base=|v_~#x~0.base_136|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_92, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, ~x$flush_delayed~0=v_~x$flush_delayed~0_50, ~#x~0.offset=|v_~#x~0.offset_136|, ~x$w_buff1~0=v_~x$w_buff1~0_87, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_1|, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_1|, #memory_int=|v_#memory_int_202|, ~#x~0.base=|v_~#x~0.base_136|, ~weak$$choice2~0=v_~weak$$choice2~0_64, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_1|} AuxVars[|v_P0_#t~mem9_32|, |v_P0_#t~ite10_33|, |v_P0_#t~mem6_34|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork2_#t~ite10] [2022-12-13 00:52:34,085 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L799: Formula: (and (= v_~x$r_buff0_thd2~0_77 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_293 256) 0)) (not (= (mod v_~x$w_buff1_used~0_275 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_137 v_~x$r_buff1_thd3~0_131) (= v_~x$w_buff0~0_162 1) (= v_~x$w_buff0~0_163 v_~x$w_buff1~0_153) (= v_~x$r_buff1_thd1~0_78 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0_used~0_294 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0_used~0_293 1) (= v_~x$r_buff1_thd2~0_60 v_~x$r_buff0_thd2~0_78) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_80 v_~x$r_buff0_thd0~0_70)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_163, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_162, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_131, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_78, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [715] L3-1-->L875: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) (let ((.cse1 (not .cse9)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_257 256) 0))) (.cse5 (= (mod v_~x$r_buff1_thd0~0_53 256) 0)) (.cse4 (= (mod v_~x$w_buff1_used~0_240 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_258 256) 0))) (let ((.cse3 (select |v_#memory_int_259| |v_~#x~0.base_174|)) (.cse0 (not .cse8)) (.cse6 (not .cse4)) (.cse7 (not .cse5)) (.cse11 (and .cse1 .cse10))) (and (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_33| |v_ULTIMATE.start_main_#t~mem39#1_31|))) (or (and .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite40#1_34| |v_ULTIMATE.start_main_#t~ite40#1_32|) (= |v_ULTIMATE.start_main_#t~ite41#1_29| v_~x$w_buff0~0_138) .cse2) (and (or (and (= (select .cse3 |v_~#x~0.offset_174|) |v_ULTIMATE.start_main_#t~mem39#1_31|) (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite40#1_32| |v_ULTIMATE.start_main_#t~mem39#1_31|)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_32| v_~x$w_buff1~0_133) .cse6 .cse2 .cse7)) (= |v_ULTIMATE.start_main_#t~ite40#1_32| |v_ULTIMATE.start_main_#t~ite41#1_29|) (or .cse8 .cse9)))) (= (ite (or (and .cse10 (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_239 256) 0)) .cse7)) 0 v_~x$r_buff1_thd0~0_53) v_~x$r_buff1_thd0~0_52) (= |v_#memory_int_258| (store |v_#memory_int_259| |v_~#x~0.base_174| (store .cse3 |v_~#x~0.offset_174| |v_ULTIMATE.start_main_#t~ite41#1_29|))) (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_258) v_~x$w_buff0_used~0_257) (= (ite (or .cse11 (and .cse6 .cse7)) 0 v_~x$w_buff1_used~0_240) v_~x$w_buff1_used~0_239) (= (ite .cse11 0 v_~x$r_buff0_thd0~0_51) v_~x$r_buff0_thd0~0_50))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_138, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~#x~0.offset=|v_~#x~0.offset_174|, ~x$w_buff1~0=v_~x$w_buff1~0_133, #memory_int=|v_#memory_int_259|, ~#x~0.base=|v_~#x~0.base_174|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_240, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_53, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_33|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_258} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_138, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_28|, ~#x~0.offset=|v_~#x~0.offset_174|, ~x$w_buff1~0=v_~x$w_buff1~0_133, #memory_int=|v_#memory_int_258|, ~#x~0.base=|v_~#x~0.base_174|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_239, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_257} AuxVars[|v_ULTIMATE.start_main_#t~mem39#1_31|, |v_ULTIMATE.start_main_#t~ite40#1_32|, |v_ULTIMATE.start_main_#t~ite41#1_29|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ~x$w_buff0_used~0] [2022-12-13 00:52:34,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L799: Formula: (and (= v_~x$r_buff0_thd2~0_77 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_293 256) 0)) (not (= (mod v_~x$w_buff1_used~0_275 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~x$r_buff0_thd3~0_137 v_~x$r_buff1_thd3~0_131) (= v_~x$w_buff0~0_162 1) (= v_~x$w_buff0~0_163 v_~x$w_buff1~0_153) (= v_~x$r_buff1_thd1~0_78 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0_used~0_294 v_~x$w_buff1_used~0_275) (= v_~x$w_buff0_used~0_293 1) (= v_~x$r_buff1_thd2~0_60 v_~x$r_buff0_thd2~0_78) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff1_thd0~0_80 v_~x$r_buff0_thd0~0_70)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_163, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_294} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_162, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_131, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_60, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_275, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_78, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_293, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [701] L835-->L842: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_217 256) 0))) (.cse6 (not .cse7)) (.cse8 (= (mod v_~x$w_buff0_used~0_218 256) 0)) (.cse10 (= 0 (mod v_~x$r_buff1_thd3~0_74 256))) (.cse9 (= (mod v_~x$w_buff1_used~0_204 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (select |v_#memory_int_219| |v_~#x~0.base_148|)) (.cse1 (not .cse10)) (.cse4 (not .cse8)) (.cse0 (and .cse11 .cse6))) (and (= v_~x$w_buff1_used~0_203 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_204)) (= |v_#memory_int_218| (store |v_#memory_int_219| |v_~#x~0.base_148| (store .cse3 |v_~#x~0.offset_148| |v_P2_#t~ite32_27|))) (let ((.cse5 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (= |v_P2_#t~ite32_27| v_~x$w_buff0~0_98) .cse4 .cse5 (= |v_P2_#t~ite31_27| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse6) (and (= |v_P2_#t~ite31_27| |v_P2_#t~ite32_27|) (or .cse7 .cse8) (or (and .cse5 (= |v_P2_#t~ite31_27| v_~x$w_buff1~0_101) .cse1 .cse2) (and (= |v_P2_#t~ite31_27| |v_P2_#t~mem30_30|) (= (select .cse3 |v_~#x~0.offset_148|) |v_P2_#t~mem30_30|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd3~0_73 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 0 v_~x$r_buff1_thd3~0_74)) (= (ite (and .cse4 .cse6) 0 v_~x$w_buff0_used~0_218) v_~x$w_buff0_used~0_217) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_78) v_~x$r_buff0_thd3~0_77))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~#x~0.offset=|v_~#x~0.offset_148|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_219|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_204, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_148|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_218|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} AuxVars[|v_P2_#t~ite31_27|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_27|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-13 00:52:34,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:52:34,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2109 [2022-12-13 00:52:34,896 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 147 flow [2022-12-13 00:52:34,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:34,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:34,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:34,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:52:34,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:34,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1376722631, now seen corresponding path program 1 times [2022-12-13 00:52:34,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:34,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983957285] [2022-12-13 00:52:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:34,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:35,062 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 00:52:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:35,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983957285] [2022-12-13 00:52:35,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983957285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:35,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:35,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950854889] [2022-12-13 00:52:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:35,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:35,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 00:52:35,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 00:52:35,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:35,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 00:52:35,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:35,358 INFO L130 PetriNetUnfolder]: 1769/2691 cut-off events. [2022-12-13 00:52:35,358 INFO L131 PetriNetUnfolder]: For 2029/2047 co-relation queries the response was YES. [2022-12-13 00:52:35,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7600 conditions, 2691 events. 1769/2691 cut-off events. For 2029/2047 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13254 event pairs, 493 based on Foata normal form. 29/1919 useless extension candidates. Maximal degree in co-relation 7584. Up to 2524 conditions per place. [2022-12-13 00:52:35,373 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 44 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2022-12-13 00:52:35,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 347 flow [2022-12-13 00:52:35,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 00:52:35,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2022-12-13 00:52:35,375 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 147 flow. Second operand 3 states and 69 transitions. [2022-12-13 00:52:35,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 347 flow [2022-12-13 00:52:35,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 337 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:35,377 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 209 flow [2022-12-13 00:52:35,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 00:52:35,378 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2022-12-13 00:52:35,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:35,378 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 209 flow [2022-12-13 00:52:35,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:35,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:35,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 209 flow [2022-12-13 00:52:35,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 209 flow [2022-12-13 00:52:35,465 INFO L130 PetriNetUnfolder]: 706/1310 cut-off events. [2022-12-13 00:52:35,466 INFO L131 PetriNetUnfolder]: For 495/513 co-relation queries the response was YES. [2022-12-13 00:52:35,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 1310 events. 706/1310 cut-off events. For 495/513 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 8876 event pairs, 284 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 3046. Up to 856 conditions per place. [2022-12-13 00:52:35,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 46 transitions, 209 flow [2022-12-13 00:52:35,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:52:35,479 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:35,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 00:52:35,480 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 209 flow [2022-12-13 00:52:35,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 00:52:35,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:35,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:35,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:52:35,480 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1537984627, now seen corresponding path program 1 times [2022-12-13 00:52:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:35,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620804563] [2022-12-13 00:52:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:36,677 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 00:52:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:36,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620804563] [2022-12-13 00:52:36,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620804563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:36,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:36,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:52:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399452134] [2022-12-13 00:52:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:36,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:52:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:36,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:52:36,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:52:36,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 00:52:36,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 209 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:36,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:36,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 00:52:36,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:37,168 INFO L130 PetriNetUnfolder]: 1618/2562 cut-off events. [2022-12-13 00:52:37,169 INFO L131 PetriNetUnfolder]: For 2212/2322 co-relation queries the response was YES. [2022-12-13 00:52:37,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8309 conditions, 2562 events. 1618/2562 cut-off events. For 2212/2322 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 13913 event pairs, 408 based on Foata normal form. 26/2118 useless extension candidates. Maximal degree in co-relation 8291. Up to 2018 conditions per place. [2022-12-13 00:52:37,185 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 61 selfloop transitions, 21 changer transitions 0/95 dead transitions. [2022-12-13 00:52:37,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 602 flow [2022-12-13 00:52:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:52:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:52:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-13 00:52:37,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5931372549019608 [2022-12-13 00:52:37,187 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 209 flow. Second operand 6 states and 121 transitions. [2022-12-13 00:52:37,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 602 flow [2022-12-13 00:52:37,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:52:37,192 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 372 flow [2022-12-13 00:52:37,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2022-12-13 00:52:37,192 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -12 predicate places. [2022-12-13 00:52:37,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:37,193 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 372 flow [2022-12-13 00:52:37,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:37,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:37,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 372 flow [2022-12-13 00:52:37,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 62 transitions, 372 flow [2022-12-13 00:52:37,351 INFO L130 PetriNetUnfolder]: 748/1371 cut-off events. [2022-12-13 00:52:37,351 INFO L131 PetriNetUnfolder]: For 1134/1194 co-relation queries the response was YES. [2022-12-13 00:52:37,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 1371 events. 748/1371 cut-off events. For 1134/1194 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 9360 event pairs, 240 based on Foata normal form. 4/810 useless extension candidates. Maximal degree in co-relation 3745. Up to 880 conditions per place. [2022-12-13 00:52:37,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 62 transitions, 372 flow [2022-12-13 00:52:37,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 812 [2022-12-13 00:52:38,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] L864-3-->L3-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [871] $Ultimate##0-->L875: Formula: (let ((.cse0 (= (mod v_~x$r_buff0_thd0~0_137 256) 0))) (let ((.cse5 (not (= (mod v_~x$w_buff0_used~0_532 256) 0))) (.cse2 (not .cse0))) (let ((.cse3 (= (mod v_~x$w_buff0_used~0_534 256) 0)) (.cse4 (and .cse5 .cse2)) (.cse1 (select |v_#memory_int_587| |v_~#x~0.base_289|))) (and (= v_~x$r_buff0_thd2~0_143 1) (= v_~x$r_buff0_thd3~0_198 v_~x$r_buff1_thd3~0_192) (= v_~x$w_buff0~0_361 v_~x$w_buff1~0_335) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~mem39#1_141| (select .cse1 |v_~#x~0.offset_289|)) (= |v_ULTIMATE.start_main_#t~ite41#1_113| |v_ULTIMATE.start_main_#t~ite40#1_142|) (= |v_ULTIMATE.start_main_#t~mem39#1_141| |v_ULTIMATE.start_main_#t~ite40#1_142|)) (and (= |v_ULTIMATE.start_main_#t~mem39#1_143| |v_ULTIMATE.start_main_#t~mem39#1_141|) (= |v_ULTIMATE.start_main_#t~ite41#1_113| v_~x$w_buff0~0_360) (= |v_ULTIMATE.start_main_#t~ite40#1_144| |v_ULTIMATE.start_main_#t~ite40#1_142|) .cse2)) (= v_~x$r_buff0_thd1~0_221 v_~x$r_buff1_thd1~0_231) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_26| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_26|) (= v_~x$r_buff0_thd2~0_144 v_~x$r_buff1_thd2~0_111) (= (ite (or (and (not .cse3) .cse2) .cse4) 0 v_~x$w_buff0_used~0_534) v_~x$w_buff1_used~0_501) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_24| |v_P1Thread1of1ForFork0_~arg#1.offset_24|) (= |v_P1Thread1of1ForFork0_~arg#1.base_24| |v_P1Thread1of1ForFork0_#in~arg#1.base_24|) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_26|) (= (ite .cse4 0 v_~x$r_buff0_thd0~0_137) v_~x$r_buff0_thd0~0_136) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_26| 0)) (= v_~x$w_buff0~0_360 1) (= v_~x$r_buff1_thd0~0_154 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_136 256) 0)) .cse5) (and (not (= (mod v_~x$w_buff1_used~0_501 256) 0)) .cse2)) 0 v_~x$r_buff0_thd0~0_137)) (= (ite .cse2 0 1) v_~x$w_buff0_used~0_532) (= (store |v_#memory_int_587| |v_~#x~0.base_289| (store .cse1 |v_~#x~0.offset_289| |v_ULTIMATE.start_main_#t~ite41#1_113|)) |v_#memory_int_586|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_361, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_137, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_221, ~#x~0.offset=|v_~#x~0.offset_289|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_198, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_534, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_24|, #memory_int=|v_#memory_int_587|, ~#x~0.base=|v_~#x~0.base_289|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_143|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_144|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_360, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_26|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_221, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_24|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_24|, ~#x~0.offset=|v_~#x~0.offset_289|, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_501, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_192, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_231, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_26|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_198, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_154, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_532, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_24|, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_112|, #memory_int=|v_#memory_int_586|, ~#x~0.base=|v_~#x~0.base_289|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_142|, |v_ULTIMATE.start_main_#t~ite41#1_113|, |v_ULTIMATE.start_main_#t~mem39#1_141|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1] [2022-12-13 00:52:38,694 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:52:38,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1502 [2022-12-13 00:52:38,695 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 378 flow [2022-12-13 00:52:38,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:38,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:38,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:52:38,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1297231160, now seen corresponding path program 1 times [2022-12-13 00:52:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527674146] [2022-12-13 00:52:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:39,484 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 00:52:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:39,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527674146] [2022-12-13 00:52:39,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527674146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:39,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:39,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:52:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424663068] [2022-12-13 00:52:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:39,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:52:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:52:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:52:39,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 00:52:39,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:39,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:39,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 00:52:39,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:39,985 INFO L130 PetriNetUnfolder]: 1657/2627 cut-off events. [2022-12-13 00:52:39,985 INFO L131 PetriNetUnfolder]: For 4750/4858 co-relation queries the response was YES. [2022-12-13 00:52:39,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9741 conditions, 2627 events. 1657/2627 cut-off events. For 4750/4858 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 14469 event pairs, 364 based on Foata normal form. 42/2206 useless extension candidates. Maximal degree in co-relation 9718. Up to 2027 conditions per place. [2022-12-13 00:52:40,001 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 57 selfloop transitions, 33 changer transitions 0/103 dead transitions. [2022-12-13 00:52:40,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 794 flow [2022-12-13 00:52:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:52:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:52:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-13 00:52:40,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4942084942084942 [2022-12-13 00:52:40,003 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 378 flow. Second operand 7 states and 128 transitions. [2022-12-13 00:52:40,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 794 flow [2022-12-13 00:52:40,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 780 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-13 00:52:40,010 INFO L231 Difference]: Finished difference. Result has 64 places, 77 transitions, 590 flow [2022-12-13 00:52:40,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=590, PETRI_PLACES=64, PETRI_TRANSITIONS=77} [2022-12-13 00:52:40,010 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-12-13 00:52:40,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:40,011 INFO L89 Accepts]: Start accepts. Operand has 64 places, 77 transitions, 590 flow [2022-12-13 00:52:40,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:40,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:40,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 77 transitions, 590 flow [2022-12-13 00:52:40,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 77 transitions, 590 flow [2022-12-13 00:52:40,125 INFO L130 PetriNetUnfolder]: 730/1398 cut-off events. [2022-12-13 00:52:40,126 INFO L131 PetriNetUnfolder]: For 2548/2603 co-relation queries the response was YES. [2022-12-13 00:52:40,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 1398 events. 730/1398 cut-off events. For 2548/2603 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 9652 event pairs, 241 based on Foata normal form. 6/824 useless extension candidates. Maximal degree in co-relation 4307. Up to 901 conditions per place. [2022-12-13 00:52:40,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 77 transitions, 590 flow [2022-12-13 00:52:40,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 866 [2022-12-13 00:52:40,140 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [870] $Ultimate##0-->L778: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_218 256) 0)) (.cse6 (= 0 (mod v_~x$w_buff0_used~0_528 256))) (.cse2 (= (mod v_~weak$$choice2~0_167 256) 0)) (.cse0 (select |v_#memory_int_583| |v_~#x~0.base_287|))) (let ((.cse5 (select .cse0 |v_~#x~0.offset_287|)) (.cse9 (= (mod v_~x$w_buff1_used~0_497 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_526 256) 0)) (.cse1 (not .cse2)) (.cse10 (and .cse4 .cse6)) (.cse3 (not .cse4))) (and (= |v_P1Thread1of1ForFork0_~arg#1.base_22| |v_P1Thread1of1ForFork0_#in~arg#1.base_22|) (= (store |v_#memory_int_583| |v_~#x~0.base_287| (store .cse0 |v_~#x~0.offset_287| |v_P0_#t~ite10_103|)) |v_#memory_int_582|) (or (and (= |v_P0Thread1of1ForFork2_#t~mem9_140| |v_P0_#t~mem9_102|) .cse1 (= |v_P0_#t~ite10_103| v_~x$mem_tmp~0_127)) (and (= v_~__unbuffered_p0_EAX~0_164 |v_P0_#t~mem9_102|) .cse2 (= |v_P0_#t~ite10_103| |v_P0_#t~mem9_102|))) (= v_~weak$$choice0~0_175 |v_P0Thread1of1ForFork2_#t~nondet3_140|) (or (and .cse3 (= (ite .cse3 v_~x$w_buff0~0_354 v_~x$w_buff1~0_331) v_~__unbuffered_p0_EAX~0_164) (= |v_P0Thread1of1ForFork2_#t~mem6_140| |v_P0_#t~mem6_104|)) (and .cse4 (= .cse5 |v_P0_#t~mem6_104|) (= v_~__unbuffered_p0_EAX~0_164 |v_P0_#t~mem6_104|))) (= (ite .cse6 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= (ite .cse1 v_~x$r_buff0_thd1~0_218 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_217 256) 0))) (or .cse7 (and .cse4 .cse8) (and .cse9 .cse8))) v_~x$r_buff0_thd1~0_218 0)) v_~x$r_buff1_thd1~0_227) (= .cse5 v_~x$mem_tmp~0_127) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| 0)) (= v_~x$flush_delayed~0_153 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_22| |v_P1Thread1of1ForFork0_~arg#1.offset_22|) (= v_~weak$$choice2~0_167 |v_P0Thread1of1ForFork2_#t~nondet4_140|) (= v_~x$w_buff0~0_354 1) (= (ite .cse1 v_~x$w_buff0_used~0_528 (ite (or .cse7 .cse4 .cse10) v_~x$w_buff0_used~0_528 0)) v_~x$w_buff1_used~0_497) (= v_~x$w_buff0~0_356 v_~x$w_buff1~0_331) (= v_~x$r_buff0_thd2~0_140 v_~x$r_buff1_thd2~0_109) (= v_~x$r_buff0_thd3~0_196 v_~x$r_buff1_thd3~0_190) (= v_~x$r_buff0_thd0~0_134 v_~x$r_buff1_thd0~0_152) (= v_~x$r_buff0_thd2~0_139 1) (= v_~x$r_buff0_thd1~0_217 (ite .cse1 v_~x$r_buff0_thd1~0_218 (ite (or .cse7 .cse4 (and .cse4 .cse9)) v_~x$r_buff0_thd1~0_218 (ite (and .cse3 (not .cse7)) 0 v_~x$r_buff0_thd1~0_218)))) (= (ite .cse1 1 (ite (or .cse4 .cse10) 1 (ite .cse3 0 1))) v_~x$w_buff0_used~0_526)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~#x~0.offset=|v_~#x~0.offset_287|, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_140|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_140|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_22|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_528, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_22|, #memory_int=|v_#memory_int_583|, ~#x~0.base=|v_~#x~0.base_287|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_140|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_140|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_217, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_22|, ~x$flush_delayed~0=v_~x$flush_delayed~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_190, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_72|, ~x$mem_tmp~0=v_~x$mem_tmp~0_127, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_22|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_72|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_164, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_72|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_22|, ~#x~0.offset=|v_~#x~0.offset_287|, ~x$w_buff1~0=v_~x$w_buff1~0_331, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_497, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_139, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_152, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_526, ~weak$$choice0~0=v_~weak$$choice0~0_175, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_72|, #memory_int=|v_#memory_int_582|, ~#x~0.base=|v_~#x~0.base_287|, ~weak$$choice2~0=v_~weak$$choice2~0_167} AuxVars[|v_P0_#t~mem9_102|, |v_P0_#t~ite10_103|, |v_P0_#t~mem6_104|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] and [694] L799-->L806: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_198 256) 0)) (.cse9 (= (mod v_~x$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_182 256) 0)) (.cse3 (not .cse10)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse3 .cse6)) (.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse5 (select |v_#memory_int_197| |v_~#x~0.base_132|)) (.cse4 (not .cse11))) (and (= v_~x$r_buff0_thd2~0_49 (ite .cse0 0 v_~x$r_buff0_thd2~0_50)) (= (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_182) v_~x$w_buff1_used~0_181) (= (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_198) v_~x$w_buff0_used~0_197) (= (store |v_#memory_int_197| |v_~#x~0.base_132| (store .cse5 |v_~#x~0.offset_132| |v_P1_#t~ite13#1_21|)) |v_#memory_int_196|) (= v_~x$r_buff1_thd2~0_42 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_181 256) 0)) .cse2) (and .cse6 (not (= (mod v_~x$r_buff0_thd2~0_49 256) 0)))) 0 v_~x$r_buff1_thd2~0_43)) (let ((.cse7 (= |v_P1_#t~mem11#1_34| |v_P1Thread1of1ForFork0_#t~mem11#1_1|))) (or (and (or (and .cse1 (= |v_P1_#t~ite12#1_31| v_~x$w_buff1~0_83) .cse2 .cse7) (and (= |v_P1_#t~mem11#1_34| (select .cse5 |v_~#x~0.offset_132|)) (= |v_P1_#t~mem11#1_34| |v_P1_#t~ite12#1_31|) (or .cse8 .cse9))) (or .cse10 .cse11) (= |v_P1_#t~ite12#1_31| |v_P1_#t~ite13#1_21|)) (and .cse3 (= |v_P1Thread1of1ForFork0_#t~ite12#1_1| |v_P1_#t~ite12#1_31|) .cse4 (= |v_P1_#t~ite13#1_21| v_~x$w_buff0~0_88) .cse7))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_88, ~#x~0.offset=|v_~#x~0.offset_132|, ~x$w_buff1~0=v_~x$w_buff1~0_83, #memory_int=|v_#memory_int_197|, ~#x~0.base=|v_~#x~0.base_132|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_182, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_50, P1Thread1of1ForFork0_#t~mem11#1=|v_P1Thread1of1ForFork0_#t~mem11#1_1|, P1Thread1of1ForFork0_#t~ite12#1=|v_P1Thread1of1ForFork0_#t~ite12#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_198} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_88, ~#x~0.offset=|v_~#x~0.offset_132|, ~x$w_buff1~0=v_~x$w_buff1~0_83, #memory_int=|v_#memory_int_196|, ~#x~0.base=|v_~#x~0.base_132|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_181, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_49, P1Thread1of1ForFork0_#t~ite13#1=|v_P1Thread1of1ForFork0_#t~ite13#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} AuxVars[|v_P1_#t~mem11#1_34|, |v_P1_#t~ite12#1_31|, |v_P1_#t~ite13#1_21|] AssignedVars[#memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~mem11#1, P1Thread1of1ForFork0_#t~ite13#1, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite12#1] [2022-12-13 00:52:41,961 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:52:41,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1952 [2022-12-13 00:52:41,962 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 77 transitions, 607 flow [2022-12-13 00:52:41,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:41,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:41,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:41,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:52:41,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:41,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1538001863, now seen corresponding path program 1 times [2022-12-13 00:52:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:41,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209757756] [2022-12-13 00:52:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:42,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 00:52:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:42,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209757756] [2022-12-13 00:52:42,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209757756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:42,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:42,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:52:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034540828] [2022-12-13 00:52:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:42,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:42,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2022-12-13 00:52:42,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 77 transitions, 607 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:42,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:42,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2022-12-13 00:52:42,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:42,389 INFO L130 PetriNetUnfolder]: 1001/1711 cut-off events. [2022-12-13 00:52:42,389 INFO L131 PetriNetUnfolder]: For 5529/5545 co-relation queries the response was YES. [2022-12-13 00:52:42,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 1711 events. 1001/1711 cut-off events. For 5529/5545 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9162 event pairs, 127 based on Foata normal form. 119/1345 useless extension candidates. Maximal degree in co-relation 7151. Up to 1198 conditions per place. [2022-12-13 00:52:42,404 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 75 selfloop transitions, 19 changer transitions 0/101 dead transitions. [2022-12-13 00:52:42,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 903 flow [2022-12-13 00:52:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-13 00:52:42,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6217948717948718 [2022-12-13 00:52:42,406 INFO L175 Difference]: Start difference. First operand has 64 places, 77 transitions, 607 flow. Second operand 4 states and 97 transitions. [2022-12-13 00:52:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 903 flow [2022-12-13 00:52:42,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 757 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-12-13 00:52:42,414 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 444 flow [2022-12-13 00:52:42,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2022-12-13 00:52:42,414 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2022-12-13 00:52:42,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:42,415 INFO L89 Accepts]: Start accepts. Operand has 61 places, 69 transitions, 444 flow [2022-12-13 00:52:42,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:42,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:42,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 69 transitions, 444 flow [2022-12-13 00:52:42,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 69 transitions, 444 flow [2022-12-13 00:52:42,494 INFO L130 PetriNetUnfolder]: 403/918 cut-off events. [2022-12-13 00:52:42,494 INFO L131 PetriNetUnfolder]: For 1209/1487 co-relation queries the response was YES. [2022-12-13 00:52:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 918 events. 403/918 cut-off events. For 1209/1487 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 6481 event pairs, 56 based on Foata normal form. 4/563 useless extension candidates. Maximal degree in co-relation 3315. Up to 568 conditions per place. [2022-12-13 00:52:42,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 69 transitions, 444 flow [2022-12-13 00:52:42,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 00:52:42,897 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] L864-3-->L3-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [871] $Ultimate##0-->L875: Formula: (let ((.cse0 (= (mod v_~x$r_buff0_thd0~0_137 256) 0))) (let ((.cse5 (not (= (mod v_~x$w_buff0_used~0_532 256) 0))) (.cse2 (not .cse0))) (let ((.cse3 (= (mod v_~x$w_buff0_used~0_534 256) 0)) (.cse4 (and .cse5 .cse2)) (.cse1 (select |v_#memory_int_587| |v_~#x~0.base_289|))) (and (= v_~x$r_buff0_thd2~0_143 1) (= v_~x$r_buff0_thd3~0_198 v_~x$r_buff1_thd3~0_192) (= v_~x$w_buff0~0_361 v_~x$w_buff1~0_335) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~mem39#1_141| (select .cse1 |v_~#x~0.offset_289|)) (= |v_ULTIMATE.start_main_#t~ite41#1_113| |v_ULTIMATE.start_main_#t~ite40#1_142|) (= |v_ULTIMATE.start_main_#t~mem39#1_141| |v_ULTIMATE.start_main_#t~ite40#1_142|)) (and (= |v_ULTIMATE.start_main_#t~mem39#1_143| |v_ULTIMATE.start_main_#t~mem39#1_141|) (= |v_ULTIMATE.start_main_#t~ite41#1_113| v_~x$w_buff0~0_360) (= |v_ULTIMATE.start_main_#t~ite40#1_144| |v_ULTIMATE.start_main_#t~ite40#1_142|) .cse2)) (= v_~x$r_buff0_thd1~0_221 v_~x$r_buff1_thd1~0_231) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_26| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_26|) (= v_~x$r_buff0_thd2~0_144 v_~x$r_buff1_thd2~0_111) (= (ite (or (and (not .cse3) .cse2) .cse4) 0 v_~x$w_buff0_used~0_534) v_~x$w_buff1_used~0_501) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_24| |v_P1Thread1of1ForFork0_~arg#1.offset_24|) (= |v_P1Thread1of1ForFork0_~arg#1.base_24| |v_P1Thread1of1ForFork0_#in~arg#1.base_24|) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_26|) (= (ite .cse4 0 v_~x$r_buff0_thd0~0_137) v_~x$r_buff0_thd0~0_136) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_26| 0)) (= v_~x$w_buff0~0_360 1) (= v_~x$r_buff1_thd0~0_154 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_136 256) 0)) .cse5) (and (not (= (mod v_~x$w_buff1_used~0_501 256) 0)) .cse2)) 0 v_~x$r_buff0_thd0~0_137)) (= (ite .cse2 0 1) v_~x$w_buff0_used~0_532) (= (store |v_#memory_int_587| |v_~#x~0.base_289| (store .cse1 |v_~#x~0.offset_289| |v_ULTIMATE.start_main_#t~ite41#1_113|)) |v_#memory_int_586|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_361, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_137, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_221, ~#x~0.offset=|v_~#x~0.offset_289|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_198, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_144, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_534, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_24|, #memory_int=|v_#memory_int_587|, ~#x~0.base=|v_~#x~0.base_289|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_143|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_144|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_360, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_136, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_26|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_221, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_24|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_24|, ~#x~0.offset=|v_~#x~0.offset_289|, ~x$w_buff1~0=v_~x$w_buff1~0_335, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_501, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_192, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_231, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_26|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_198, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_154, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_143, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_532, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_24|, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_112|, #memory_int=|v_#memory_int_586|, ~#x~0.base=|v_~#x~0.base_289|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_142|, |v_ULTIMATE.start_main_#t~ite41#1_113|, |v_ULTIMATE.start_main_#t~mem39#1_141|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1] [2022-12-13 00:52:43,737 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [855] L864-3-->L3-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [877] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd0~0_157 256) 0))) (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_566 256) 0))) (.cse0 (not .cse5))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_567 256) 0)) (.cse2 (and .cse4 .cse0)) (.cse3 (select |v_#memory_int_619| |v_~#x~0.base_303|))) (and (= (ite .cse0 0 1) v_~x$w_buff0_used~0_566) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|) (= v_~x$w_buff0~0_382 1) (= (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~x$w_buff0_used~0_567) v_~x$w_buff1_used~0_527) (= v_~x$r_buff0_thd2~0_166 v_~x$r_buff1_thd2~0_125) (= v_~x$w_buff0~0_383 v_~x$w_buff1~0_349) (= v_~x$r_buff0_thd3~0_208 v_~x$r_buff1_thd3~0_202) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_115| (mod v_~main$tmp_guard1~0_130 256)) (= v_~x$r_buff0_thd0~0_156 (ite .cse2 0 v_~x$r_buff0_thd0~0_157)) (= v_~x$r_buff0_thd2~0_165 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_115| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_141|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_32| |v_P1Thread1of1ForFork0_~arg#1.offset_32|) (= (store |v_#memory_int_619| |v_~#x~0.base_303| (store .cse3 |v_~#x~0.offset_303| |v_ULTIMATE.start_main_#t~ite41#1_132|)) |v_#memory_int_618|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_141| 0) (= v_~weak$$choice1~0_190 |v_ULTIMATE.start_main_#t~nondet42#1_213|) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_527 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_156 256) 0)))) 0 v_~x$r_buff0_thd0~0_157) v_~x$r_buff1_thd0~0_172) (= |v_P1Thread1of1ForFork0_~arg#1.base_32| |v_P1Thread1of1ForFork0_#in~arg#1.base_32|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_253 1) (= v_~y~0_128 2) (= v_~__unbuffered_p0_EAX~0_168 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_130) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_132| v_~x$w_buff0~0_382) .cse0 (= |v_ULTIMATE.start_main_#t~mem39#1_168| |v_ULTIMATE.start_main_#t~mem39#1_170|) (= |v_ULTIMATE.start_main_#t~ite40#1_169| |v_ULTIMATE.start_main_#t~ite40#1_171|)) (and (= |v_ULTIMATE.start_main_#t~mem39#1_168| (select .cse3 |v_~#x~0.offset_303|)) (= |v_ULTIMATE.start_main_#t~ite41#1_132| |v_ULTIMATE.start_main_#t~ite40#1_169|) .cse5 (= |v_ULTIMATE.start_main_#t~mem39#1_168| |v_ULTIMATE.start_main_#t~ite40#1_169|))) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem43#1_326| |v_ULTIMATE.start_main_#t~mem43#1_324|)) (.cse6 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_133 256) 0))) (or (and (not .cse6) (= |v_ULTIMATE.start_main_#t~ite44#1_323| v_~__unbuffered_p2_EAX~0_253) (let ((.cse8 (= (mod v_~weak$$choice1~0_190 256) 0))) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite44#1_323| v_~__unbuffered_p2_EAX~0_254) .cse8) (and (not .cse8) (= |v_ULTIMATE.start_main_#t~mem43#1_324| (select (select |v_#memory_int_618| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_136) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_136)) (= |v_ULTIMATE.start_main_#t~mem43#1_324| |v_ULTIMATE.start_main_#t~ite44#1_323|))))) (and .cse7 (= v_~__unbuffered_p2_EAX~0_254 v_~__unbuffered_p2_EAX~0_253) .cse6 (= |v_ULTIMATE.start_main_#t~ite44#1_325| |v_ULTIMATE.start_main_#t~ite44#1_323|)))) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|) (= v_~x$r_buff0_thd1~0_231 v_~x$r_buff1_thd1~0_239))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_383, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_231, ~#x~0.offset=|v_~#x~0.offset_303|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_136, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_136, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_326|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_208, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_213|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_166, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_32|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_133, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_567, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_168, #memory_int=|v_#memory_int_619|, ~#x~0.base=|v_~#x~0.base_303|, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_325|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_254, ~y~0=v_~y~0_128, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_170|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_171|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_382, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_141|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_231, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_32|, ULTIMATE.start_main_#t~ite45#1=|v_ULTIMATE.start_main_#t~ite45#1_142|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_136, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_136, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_202, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_130, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_208, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_32|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_168, ~weak$$choice1~0=v_~weak$$choice1~0_190, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_131|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_253, ~y~0=v_~y~0_128, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_32|, ~#x~0.offset=|v_~#x~0.offset_303|, ~x$w_buff1~0=v_~x$w_buff1~0_349, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_527, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_172, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_133, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_566, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_115|, #memory_int=|v_#memory_int_618|, ~#x~0.base=|v_~#x~0.base_303|} AuxVars[|v_ULTIMATE.start_main_#t~ite44#1_323|, |v_ULTIMATE.start_main_#t~mem43#1_324|, |v_ULTIMATE.start_main_#t~ite41#1_132|, |v_ULTIMATE.start_main_#t~mem39#1_168|, |v_ULTIMATE.start_main_#t~ite40#1_169|] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start_main_#t~ite45#1, ULTIMATE.start_main_#t~mem43#1, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet42#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #memory_int] [2022-12-13 00:52:44,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:52:44,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2090 [2022-12-13 00:52:44,504 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 460 flow [2022-12-13 00:52:44,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:44,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:44,504 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:44,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:52:44,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1265102897, now seen corresponding path program 1 times [2022-12-13 00:52:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:44,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870939995] [2022-12-13 00:52:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:44,637 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 00:52:44,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:44,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870939995] [2022-12-13 00:52:44,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870939995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:44,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:44,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:52:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687595618] [2022-12-13 00:52:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:44,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:52:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:52:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:52:44,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-13 00:52:44,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 460 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 00:52:44,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:44,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-13 00:52:44,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:44,840 INFO L130 PetriNetUnfolder]: 542/997 cut-off events. [2022-12-13 00:52:44,840 INFO L131 PetriNetUnfolder]: For 2037/2043 co-relation queries the response was YES. [2022-12-13 00:52:44,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 997 events. 542/997 cut-off events. For 2037/2043 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5066 event pairs, 37 based on Foata normal form. 135/819 useless extension candidates. Maximal degree in co-relation 4337. Up to 487 conditions per place. [2022-12-13 00:52:44,845 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 62 selfloop transitions, 28 changer transitions 0/97 dead transitions. [2022-12-13 00:52:44,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 793 flow [2022-12-13 00:52:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:52:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:52:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 00:52:44,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2022-12-13 00:52:44,846 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 460 flow. Second operand 5 states and 102 transitions. [2022-12-13 00:52:44,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 793 flow [2022-12-13 00:52:44,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 687 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 00:52:44,852 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 410 flow [2022-12-13 00:52:44,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2022-12-13 00:52:44,852 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2022-12-13 00:52:44,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:44,852 INFO L89 Accepts]: Start accepts. Operand has 61 places, 65 transitions, 410 flow [2022-12-13 00:52:44,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:44,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:44,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 65 transitions, 410 flow [2022-12-13 00:52:44,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 65 transitions, 410 flow [2022-12-13 00:52:44,882 INFO L130 PetriNetUnfolder]: 160/441 cut-off events. [2022-12-13 00:52:44,882 INFO L131 PetriNetUnfolder]: For 360/557 co-relation queries the response was YES. [2022-12-13 00:52:44,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 441 events. 160/441 cut-off events. For 360/557 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 2840 event pairs, 2 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 1455. Up to 271 conditions per place. [2022-12-13 00:52:44,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 65 transitions, 410 flow [2022-12-13 00:52:44,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 00:52:46,389 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:52:46,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1538 [2022-12-13 00:52:46,390 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 406 flow [2022-12-13 00:52:46,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 00:52:46,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:46,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:46,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:52:46,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash 69515263, now seen corresponding path program 1 times [2022-12-13 00:52:46,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:46,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655432925] [2022-12-13 00:52:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:46,558 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 00:52:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:46,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655432925] [2022-12-13 00:52:46,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655432925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:46,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:46,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077038866] [2022-12-13 00:52:46,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:46,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:46,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:52:46,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 00:52:46,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:46,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:52:46,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:46,729 INFO L130 PetriNetUnfolder]: 683/1243 cut-off events. [2022-12-13 00:52:46,729 INFO L131 PetriNetUnfolder]: For 2518/2624 co-relation queries the response was YES. [2022-12-13 00:52:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5133 conditions, 1243 events. 683/1243 cut-off events. For 2518/2624 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 6935 event pairs, 125 based on Foata normal form. 89/1071 useless extension candidates. Maximal degree in co-relation 5109. Up to 633 conditions per place. [2022-12-13 00:52:46,735 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 59 selfloop transitions, 2 changer transitions 24/98 dead transitions. [2022-12-13 00:52:46,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 829 flow [2022-12-13 00:52:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 00:52:46,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 00:52:46,736 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 406 flow. Second operand 3 states and 63 transitions. [2022-12-13 00:52:46,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 829 flow [2022-12-13 00:52:46,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 707 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 00:52:46,749 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 330 flow [2022-12-13 00:52:46,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2022-12-13 00:52:46,750 INFO L295 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-12-13 00:52:46,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:46,750 INFO L89 Accepts]: Start accepts. Operand has 59 places, 60 transitions, 330 flow [2022-12-13 00:52:46,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:46,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:46,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 60 transitions, 330 flow [2022-12-13 00:52:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 330 flow [2022-12-13 00:52:46,776 INFO L130 PetriNetUnfolder]: 133/322 cut-off events. [2022-12-13 00:52:46,776 INFO L131 PetriNetUnfolder]: For 317/326 co-relation queries the response was YES. [2022-12-13 00:52:46,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 322 events. 133/322 cut-off events. For 317/326 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 1812 event pairs, 0 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 936. Up to 154 conditions per place. [2022-12-13 00:52:46,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 330 flow [2022-12-13 00:52:46,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 00:52:46,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [870] $Ultimate##0-->L778: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_218 256) 0)) (.cse6 (= 0 (mod v_~x$w_buff0_used~0_528 256))) (.cse2 (= (mod v_~weak$$choice2~0_167 256) 0)) (.cse0 (select |v_#memory_int_583| |v_~#x~0.base_287|))) (let ((.cse5 (select .cse0 |v_~#x~0.offset_287|)) (.cse9 (= (mod v_~x$w_buff1_used~0_497 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_526 256) 0)) (.cse1 (not .cse2)) (.cse10 (and .cse4 .cse6)) (.cse3 (not .cse4))) (and (= |v_P1Thread1of1ForFork0_~arg#1.base_22| |v_P1Thread1of1ForFork0_#in~arg#1.base_22|) (= (store |v_#memory_int_583| |v_~#x~0.base_287| (store .cse0 |v_~#x~0.offset_287| |v_P0_#t~ite10_103|)) |v_#memory_int_582|) (or (and (= |v_P0Thread1of1ForFork2_#t~mem9_140| |v_P0_#t~mem9_102|) .cse1 (= |v_P0_#t~ite10_103| v_~x$mem_tmp~0_127)) (and (= v_~__unbuffered_p0_EAX~0_164 |v_P0_#t~mem9_102|) .cse2 (= |v_P0_#t~ite10_103| |v_P0_#t~mem9_102|))) (= v_~weak$$choice0~0_175 |v_P0Thread1of1ForFork2_#t~nondet3_140|) (or (and .cse3 (= (ite .cse3 v_~x$w_buff0~0_354 v_~x$w_buff1~0_331) v_~__unbuffered_p0_EAX~0_164) (= |v_P0Thread1of1ForFork2_#t~mem6_140| |v_P0_#t~mem6_104|)) (and .cse4 (= .cse5 |v_P0_#t~mem6_104|) (= v_~__unbuffered_p0_EAX~0_164 |v_P0_#t~mem6_104|))) (= (ite .cse6 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= (ite .cse1 v_~x$r_buff0_thd1~0_218 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_217 256) 0))) (or .cse7 (and .cse4 .cse8) (and .cse9 .cse8))) v_~x$r_buff0_thd1~0_218 0)) v_~x$r_buff1_thd1~0_227) (= .cse5 v_~x$mem_tmp~0_127) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| 0)) (= v_~x$flush_delayed~0_153 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_22| |v_P1Thread1of1ForFork0_~arg#1.offset_22|) (= v_~weak$$choice2~0_167 |v_P0Thread1of1ForFork2_#t~nondet4_140|) (= v_~x$w_buff0~0_354 1) (= (ite .cse1 v_~x$w_buff0_used~0_528 (ite (or .cse7 .cse4 .cse10) v_~x$w_buff0_used~0_528 0)) v_~x$w_buff1_used~0_497) (= v_~x$w_buff0~0_356 v_~x$w_buff1~0_331) (= v_~x$r_buff0_thd2~0_140 v_~x$r_buff1_thd2~0_109) (= v_~x$r_buff0_thd3~0_196 v_~x$r_buff1_thd3~0_190) (= v_~x$r_buff0_thd0~0_134 v_~x$r_buff1_thd0~0_152) (= v_~x$r_buff0_thd2~0_139 1) (= v_~x$r_buff0_thd1~0_217 (ite .cse1 v_~x$r_buff0_thd1~0_218 (ite (or .cse7 .cse4 (and .cse4 .cse9)) v_~x$r_buff0_thd1~0_218 (ite (and .cse3 (not .cse7)) 0 v_~x$r_buff0_thd1~0_218)))) (= (ite .cse1 1 (ite (or .cse4 .cse10) 1 (ite .cse3 0 1))) v_~x$w_buff0_used~0_526)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~#x~0.offset=|v_~#x~0.offset_287|, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_140|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_140|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_22|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_528, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_22|, #memory_int=|v_#memory_int_583|, ~#x~0.base=|v_~#x~0.base_287|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_140|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_140|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_217, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_22|, ~x$flush_delayed~0=v_~x$flush_delayed~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_190, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_72|, ~x$mem_tmp~0=v_~x$mem_tmp~0_127, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_22|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_72|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_164, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_72|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_22|, ~#x~0.offset=|v_~#x~0.offset_287|, ~x$w_buff1~0=v_~x$w_buff1~0_331, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_497, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_139, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_152, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_526, ~weak$$choice0~0=v_~weak$$choice0~0_175, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_72|, #memory_int=|v_#memory_int_582|, ~#x~0.base=|v_~#x~0.base_287|, ~weak$$choice2~0=v_~weak$$choice2~0_167} AuxVars[|v_P0_#t~mem9_102|, |v_P0_#t~ite10_103|, |v_P0_#t~mem6_104|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] and [701] L835-->L842: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_217 256) 0))) (.cse6 (not .cse7)) (.cse8 (= (mod v_~x$w_buff0_used~0_218 256) 0)) (.cse10 (= 0 (mod v_~x$r_buff1_thd3~0_74 256))) (.cse9 (= (mod v_~x$w_buff1_used~0_204 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (select |v_#memory_int_219| |v_~#x~0.base_148|)) (.cse1 (not .cse10)) (.cse4 (not .cse8)) (.cse0 (and .cse11 .cse6))) (and (= v_~x$w_buff1_used~0_203 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_204)) (= |v_#memory_int_218| (store |v_#memory_int_219| |v_~#x~0.base_148| (store .cse3 |v_~#x~0.offset_148| |v_P2_#t~ite32_27|))) (let ((.cse5 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (= |v_P2_#t~ite32_27| v_~x$w_buff0~0_98) .cse4 .cse5 (= |v_P2_#t~ite31_27| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse6) (and (= |v_P2_#t~ite31_27| |v_P2_#t~ite32_27|) (or .cse7 .cse8) (or (and .cse5 (= |v_P2_#t~ite31_27| v_~x$w_buff1~0_101) .cse1 .cse2) (and (= |v_P2_#t~ite31_27| |v_P2_#t~mem30_30|) (= (select .cse3 |v_~#x~0.offset_148|) |v_P2_#t~mem30_30|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd3~0_73 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 0 v_~x$r_buff1_thd3~0_74)) (= (ite (and .cse4 .cse6) 0 v_~x$w_buff0_used~0_218) v_~x$w_buff0_used~0_217) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_78) v_~x$r_buff0_thd3~0_77))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~#x~0.offset=|v_~#x~0.offset_148|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_219|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_204, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_148|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_218|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} AuxVars[|v_P2_#t~ite31_27|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_27|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-13 00:52:51,989 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L760: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_14 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_14, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [876] $Ultimate##0-->L806: Formula: (let ((.cse10 (= (mod v_~x$w_buff0_used~0_562 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_228 256) 0)) (.cse14 (= (mod v_~weak$$choice2~0_169 256) 0))) (let ((.cse4 (not .cse14)) (.cse15 (and .cse10 .cse5)) (.cse7 (not .cse5))) (let ((.cse2 (ite .cse4 1 (ite (or .cse15 .cse5) 1 (ite .cse7 0 1))))) (let ((.cse3 (= (mod .cse2 256) 0))) (let ((.cse0 (select |v_#memory_int_614| |v_~#x~0.base_301|)) (.cse13 (ite .cse4 v_~x$w_buff0_used~0_562 (ite (or .cse15 .cse3 .cse5) v_~x$w_buff0_used~0_562 0)))) (let ((.cse1 (not .cse3)) (.cse9 (not (= (mod v_~x$r_buff0_thd2~0_161 256) 0))) (.cse6 (= (mod .cse13 256) 0)) (.cse8 (not (= (mod v_~x$w_buff0_used~0_560 256) 0))) (.cse12 (select .cse0 |v_~#x~0.offset_301|))) (and (= |v_#memory_int_612| (store |v_#memory_int_614| |v_~#x~0.base_301| (store .cse0 |v_~#x~0.offset_301| |v_P1_#t~ite13#1_38|))) (= v_~weak$$choice0~0_177 |v_P0Thread1of1ForFork2_#t~nondet3_144|) (= (ite .cse1 0 .cse2) v_~x$w_buff0_used~0_560) (or (and .cse3 (= |v_P1_#t~mem11#1_51| |v_P0_#t~ite10_107|) (= |v_P1_#t~ite12#1_48| |v_P1_#t~ite13#1_38|) (= |v_P1_#t~mem11#1_51| |v_P1_#t~ite12#1_48|)) (and (= v_~x$w_buff0~0_378 |v_P1_#t~ite13#1_38|) .cse1 (= |v_P1Thread1of1ForFork0_#t~ite12#1_34| |v_P1_#t~ite12#1_48|) (= |v_P1_#t~mem11#1_51| |v_P1Thread1of1ForFork0_#t~mem11#1_34|))) (= (ite .cse4 v_~x$r_buff0_thd1~0_228 (ite (or (and .cse5 .cse6) .cse3 .cse5) v_~x$r_buff0_thd1~0_228 (ite (and .cse7 .cse1) 0 v_~x$r_buff0_thd1~0_228))) v_~x$r_buff0_thd1~0_227) (= v_~x$r_buff1_thd2~0_121 (ite (or (and .cse8 (not (= (mod v_~x$r_buff0_thd2~0_159 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_523 256) 0)) .cse9)) 0 v_~x$r_buff0_thd2~0_161)) (= (ite .cse10 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= (ite .cse4 v_~x$r_buff0_thd1~0_228 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd1~0_227 256) 0))) (or (and .cse11 .cse6) (and .cse11 .cse5) .cse3)) v_~x$r_buff0_thd1~0_228 0)) v_~x$r_buff1_thd1~0_237) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$w_buff0~0_379 v_~x$w_buff1~0_347) (or (and .cse7 (= |v_P0Thread1of1ForFork2_#t~mem6_144| |v_P0_#t~mem6_108|) (= (ite .cse7 v_~x$w_buff0~0_378 v_~x$w_buff1~0_347) v_~__unbuffered_p0_EAX~0_166)) (and (= v_~__unbuffered_p0_EAX~0_166 |v_P0_#t~mem6_108|) (= .cse12 |v_P0_#t~mem6_108|) .cse5)) (= v_~x$flush_delayed~0_155 0) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| 0)) (= v_~x$w_buff1_used~0_523 (ite (or .cse8 (and .cse9 (not .cse6))) 0 .cse13)) (= v_~x$w_buff0~0_378 1) (= v_~weak$$choice2~0_169 |v_P0Thread1of1ForFork2_#t~nondet4_144|) (= (ite .cse8 0 1) v_~x$r_buff0_thd2~0_159) (= v_~x$r_buff0_thd0~0_154 v_~x$r_buff1_thd0~0_170) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= .cse12 v_~x$mem_tmp~0_129) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|) (= v_~x$r_buff0_thd3~0_206 v_~x$r_buff1_thd3~0_200) (or (and (= |v_P0Thread1of1ForFork2_#t~mem9_144| |v_P0_#t~mem9_106|) .cse4 (= |v_P0_#t~ite10_107| v_~x$mem_tmp~0_129)) (and (= |v_P0_#t~ite10_107| |v_P0_#t~mem9_106|) .cse14 (= v_~__unbuffered_p0_EAX~0_166 |v_P0_#t~mem9_106|)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_379, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_228, ~#x~0.offset=|v_~#x~0.offset_301|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_206, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_144|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_161, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_144|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_562, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, #memory_int=|v_#memory_int_614|, ~#x~0.base=|v_~#x~0.base_301|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_144|, P1Thread1of1ForFork0_#t~mem11#1=|v_P1Thread1of1ForFork0_#t~mem11#1_34|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_144|, P1Thread1of1ForFork0_#t~ite12#1=|v_P1Thread1of1ForFork0_#t~ite12#1_34|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_378, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_155, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_200, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_237, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_74|, ~x$mem_tmp~0=v_~x$mem_tmp~0_129, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_32|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_206, P1Thread1of1ForFork0_#t~ite13#1=|v_P1Thread1of1ForFork0_#t~ite13#1_19|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_74|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_166, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_74|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_154, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_32|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~#x~0.offset=|v_~#x~0.offset_301|, ~x$w_buff1~0=v_~x$w_buff1~0_347, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_121, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_523, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_159, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_170, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_560, ~weak$$choice0~0=v_~weak$$choice0~0_177, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_74|, #memory_int=|v_#memory_int_612|, ~#x~0.base=|v_~#x~0.base_301|, ~weak$$choice2~0=v_~weak$$choice2~0_169} AuxVars[|v_P1_#t~ite13#1_38|, |v_P0_#t~ite10_107|, |v_P1_#t~mem11#1_51|, |v_P0_#t~mem6_108|, |v_P0_#t~mem9_106|, |v_P1_#t~ite12#1_48|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P1Thread1of1ForFork0_#t~ite13#1, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork0_#t~mem11#1, P0Thread1of1ForFork2_#t~nondet3, P1Thread1of1ForFork0_#t~ite12#1] [2022-12-13 00:52:52,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L760: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_14 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_14, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [870] $Ultimate##0-->L778: Formula: (let ((.cse4 (= (mod v_~x$r_buff0_thd1~0_218 256) 0)) (.cse6 (= 0 (mod v_~x$w_buff0_used~0_528 256))) (.cse2 (= (mod v_~weak$$choice2~0_167 256) 0)) (.cse0 (select |v_#memory_int_583| |v_~#x~0.base_287|))) (let ((.cse5 (select .cse0 |v_~#x~0.offset_287|)) (.cse9 (= (mod v_~x$w_buff1_used~0_497 256) 0)) (.cse7 (= (mod v_~x$w_buff0_used~0_526 256) 0)) (.cse1 (not .cse2)) (.cse10 (and .cse4 .cse6)) (.cse3 (not .cse4))) (and (= |v_P1Thread1of1ForFork0_~arg#1.base_22| |v_P1Thread1of1ForFork0_#in~arg#1.base_22|) (= (store |v_#memory_int_583| |v_~#x~0.base_287| (store .cse0 |v_~#x~0.offset_287| |v_P0_#t~ite10_103|)) |v_#memory_int_582|) (or (and (= |v_P0Thread1of1ForFork2_#t~mem9_140| |v_P0_#t~mem9_102|) .cse1 (= |v_P0_#t~ite10_103| v_~x$mem_tmp~0_127)) (and (= v_~__unbuffered_p0_EAX~0_164 |v_P0_#t~mem9_102|) .cse2 (= |v_P0_#t~ite10_103| |v_P0_#t~mem9_102|))) (= v_~weak$$choice0~0_175 |v_P0Thread1of1ForFork2_#t~nondet3_140|) (or (and .cse3 (= (ite .cse3 v_~x$w_buff0~0_354 v_~x$w_buff1~0_331) v_~__unbuffered_p0_EAX~0_164) (= |v_P0Thread1of1ForFork2_#t~mem6_140| |v_P0_#t~mem6_104|)) (and .cse4 (= .cse5 |v_P0_#t~mem6_104|) (= v_~__unbuffered_p0_EAX~0_164 |v_P0_#t~mem6_104|))) (= (ite .cse6 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= (ite .cse1 v_~x$r_buff0_thd1~0_218 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_217 256) 0))) (or .cse7 (and .cse4 .cse8) (and .cse9 .cse8))) v_~x$r_buff0_thd1~0_218 0)) v_~x$r_buff1_thd1~0_227) (= .cse5 v_~x$mem_tmp~0_127) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| 0)) (= v_~x$flush_delayed~0_153 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_22| |v_P1Thread1of1ForFork0_~arg#1.offset_22|) (= v_~weak$$choice2~0_167 |v_P0Thread1of1ForFork2_#t~nondet4_140|) (= v_~x$w_buff0~0_354 1) (= (ite .cse1 v_~x$w_buff0_used~0_528 (ite (or .cse7 .cse4 .cse10) v_~x$w_buff0_used~0_528 0)) v_~x$w_buff1_used~0_497) (= v_~x$w_buff0~0_356 v_~x$w_buff1~0_331) (= v_~x$r_buff0_thd2~0_140 v_~x$r_buff1_thd2~0_109) (= v_~x$r_buff0_thd3~0_196 v_~x$r_buff1_thd3~0_190) (= v_~x$r_buff0_thd0~0_134 v_~x$r_buff1_thd0~0_152) (= v_~x$r_buff0_thd2~0_139 1) (= v_~x$r_buff0_thd1~0_217 (ite .cse1 v_~x$r_buff0_thd1~0_218 (ite (or .cse7 .cse4 (and .cse4 .cse9)) v_~x$r_buff0_thd1~0_218 (ite (and .cse3 (not .cse7)) 0 v_~x$r_buff0_thd1~0_218)))) (= (ite .cse1 1 (ite (or .cse4 .cse10) 1 (ite .cse3 0 1))) v_~x$w_buff0_used~0_526)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_356, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_218, ~#x~0.offset=|v_~#x~0.offset_287|, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_140|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_140|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_22|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_528, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_22|, #memory_int=|v_#memory_int_583|, ~#x~0.base=|v_~#x~0.base_287|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_140|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_140|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_217, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_22|, ~x$flush_delayed~0=v_~x$flush_delayed~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_190, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_227, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_72|, ~x$mem_tmp~0=v_~x$mem_tmp~0_127, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_22|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_72|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_164, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_72|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_22|, ~#x~0.offset=|v_~#x~0.offset_287|, ~x$w_buff1~0=v_~x$w_buff1~0_331, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_497, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_139, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_152, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_526, ~weak$$choice0~0=v_~weak$$choice0~0_175, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_72|, #memory_int=|v_#memory_int_582|, ~#x~0.base=|v_~#x~0.base_287|, ~weak$$choice2~0=v_~weak$$choice2~0_167} AuxVars[|v_P0_#t~mem9_102|, |v_P0_#t~ite10_103|, |v_P0_#t~mem6_104|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:52:53,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L760: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_14 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_14, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [884] $Ultimate##0-->L842: Formula: (let ((.cse15 (= (mod v_~x$w_buff0_used~0_596 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd1~0_238 256) 0)) (.cse6 (= (mod v_~weak$$choice2~0_171 256) 0))) (let ((.cse7 (not .cse6)) (.cse17 (and .cse15 .cse8)) (.cse11 (not .cse8))) (let ((.cse14 (ite .cse7 1 (ite (or .cse17 .cse8) 1 (ite .cse11 0 1))))) (let ((.cse12 (= (mod v_~x$r_buff0_thd3~0_215 256) 0)) (.cse9 (= (mod .cse14 256) 0))) (let ((.cse3 (ite .cse7 v_~x$w_buff0_used~0_596 (ite (or .cse9 .cse17 .cse8) v_~x$w_buff0_used~0_596 0))) (.cse4 (select |v_#memory_int_648| |v_~#x~0.base_317|)) (.cse1 (not .cse12)) (.cse16 (not (= (mod v_~x$w_buff0_used~0_594 256) 0)))) (let ((.cse2 (and .cse1 .cse16)) (.cse5 (select .cse4 |v_~#x~0.offset_317|)) (.cse0 (= (mod .cse3 256) 0)) (.cse10 (not .cse9))) (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_40| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_40|) (= v_~x$w_buff1_used~0_549 (ite (or (and (not .cse0) .cse1) .cse2) 0 .cse3)) (= (store |v_#memory_int_648| |v_~#x~0.base_317| (store .cse4 |v_~#x~0.offset_317| |v_P2_#t~ite32_44|)) |v_#memory_int_646|) (= v_~x$w_buff0~0_402 1) (= v_~x$w_buff0~0_403 v_~x$w_buff1~0_363) (= v_~x$flush_delayed~0_157 0) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_215) v_~x$r_buff0_thd3~0_214) (= v_~x$r_buff0_thd2~0_178 v_~x$r_buff1_thd2~0_131) (= .cse5 v_~x$mem_tmp~0_131) (= |v_P1Thread1of1ForFork0_~arg#1.base_38| |v_P1Thread1of1ForFork0_#in~arg#1.base_38|) (or (and (= |v_P0_#t~ite10_112| |v_P0_#t~mem9_111|) .cse6 (= v_~__unbuffered_p0_EAX~0_176 |v_P0_#t~mem9_111|)) (and (= |v_P0_#t~ite10_112| v_~x$mem_tmp~0_131) .cse7 (= |v_P0Thread1of1ForFork2_#t~mem9_148| |v_P0_#t~mem9_111|))) (= v_~x$r_buff0_thd2~0_177 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_38| |v_P1Thread1of1ForFork0_~arg#1.offset_38|) (= (ite .cse7 v_~x$r_buff0_thd1~0_238 (ite (or (and .cse0 .cse8) .cse9 .cse8) v_~x$r_buff0_thd1~0_238 (ite (and .cse10 .cse11) 0 v_~x$r_buff0_thd1~0_238))) v_~x$r_buff0_thd1~0_237) (or (and (= .cse5 |v_P0_#t~mem6_113|) (= v_~__unbuffered_p0_EAX~0_176 |v_P0_#t~mem6_113|) .cse8) (and (= (ite .cse11 v_~x$w_buff0~0_402 v_~x$w_buff1~0_363) v_~__unbuffered_p0_EAX~0_176) .cse11 (= |v_P0Thread1of1ForFork2_#t~mem6_148| |v_P0_#t~mem6_113|))) (= v_~weak$$choice2~0_171 |v_P0Thread1of1ForFork2_#t~nondet4_148|) (or (and (= |v_P2_#t~ite31_44| |v_P2_#t~ite32_44|) (= |v_P2_#t~ite31_44| |v_P2_#t~mem30_47|) (or .cse9 .cse12) (= |v_P0_#t~ite10_112| |v_P2_#t~mem30_47|)) (and .cse1 .cse10 (= |v_P2_#t~ite32_44| v_~x$w_buff0~0_402) (= |v_P2Thread1of1ForFork1_#t~mem30_30| |v_P2_#t~mem30_47|) (= |v_P2_#t~ite31_44| |v_P2Thread1of1ForFork1_#t~ite31_30|))) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_40| 0)) (= v_~x$r_buff0_thd0~0_184 v_~x$r_buff1_thd0~0_194) (= v_~x$r_buff1_thd1~0_245 (ite .cse7 v_~x$r_buff0_thd1~0_238 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_237 256) 0))) (or .cse9 (and .cse13 .cse8) (and .cse13 .cse0))) v_~x$r_buff0_thd1~0_238 0))) (= v_~weak$$choice0~0_179 |v_P0Thread1of1ForFork2_#t~nondet3_148|) (= v_~x$w_buff0_used~0_594 (ite (and .cse1 .cse10) 0 .cse14)) (= (ite .cse15 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_40|) (= (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_549 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_214 256) 0)) .cse16)) 0 v_~x$r_buff0_thd3~0_215) v_~x$r_buff1_thd3~0_208)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_184, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_238, ~#x~0.offset=|v_~#x~0.offset_317|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_215, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_148|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_178, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_148|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_38|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_30|, #memory_int=|v_#memory_int_648|, ~#x~0.base=|v_~#x~0.base_317|, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_30|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_148|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_148|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_402, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_237, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_38|, ~x$flush_delayed~0=v_~x$flush_delayed~0_157, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_208, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_245, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_76|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_214, ~x$mem_tmp~0=v_~x$mem_tmp~0_131, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_40|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_38|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_76|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_76|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_184, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_40|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_38|, ~#x~0.offset=|v_~#x~0.offset_317|, ~x$w_buff1~0=v_~x$w_buff1~0_363, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_549, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_594, ~weak$$choice0~0=v_~weak$$choice0~0_179, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_17|, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_76|, #memory_int=|v_#memory_int_646|, ~#x~0.base=|v_~#x~0.base_317|, ~weak$$choice2~0=v_~weak$$choice2~0_171} AuxVars[|v_P2_#t~ite32_44|, |v_P2_#t~mem30_47|, |v_P0_#t~mem9_111|, |v_P0_#t~mem6_113|, |v_P0_#t~ite10_112|, |v_P2_#t~ite31_44|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~mem30, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P2Thread1of1ForFork1_#t~ite32, P0Thread1of1ForFork2_#t~ite7, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:52:54,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [885] $Ultimate##0-->L835: Formula: (let ((.cse16 (mod v_~weak$$choice0~0_181 256)) (.cse11 (mod v_~x$w_buff0_used~0_601 256)) (.cse9 (= (mod v_~x$r_buff0_thd3~0_219 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_600 256) 0))) (let ((.cse2 (not .cse1)) (.cse14 (not .cse9)) (.cse26 (= (mod v_~weak$$choice2~0_173 256) 0)) (.cse10 (select |v_#memory_int_653| |v_~#x~0.base_319|)) (.cse12 (= .cse11 0)) (.cse24 (= .cse16 0)) (.cse25 (= (mod v_~x$w_buff1_used~0_554 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice1~0_198 256) 0)) (.cse8 (not .cse25)) (.cse6 (not .cse24)) (.cse13 (not .cse12)) (.cse17 (select .cse10 |v_~#x~0.offset_319|)) (.cse0 (not .cse26)) (.cse7 (and .cse2 .cse14)) (.cse4 (= (mod v_~x$r_buff1_thd3~0_213 256) 0)) (.cse5 (not (= (mod v_~x$w_buff1_used~0_553 256) 0)))) (and (= (ite .cse0 v_~x$r_buff1_thd3~0_213 (ite .cse1 v_~x$r_buff1_thd3~0_213 (let ((.cse3 (= (mod v_~x$r_buff0_thd3~0_218 256) 0))) (ite (and .cse2 (not .cse3)) 0 (ite (and .cse3 .cse2 .cse4 .cse5) (ite .cse6 v_~x$r_buff1_thd3~0_213 0) 0))))) v_~x$r_buff1_thd3~0_212) (= v_~x$w_buff1_used~0_553 (ite .cse0 v_~x$w_buff1_used~0_554 (ite .cse1 v_~x$w_buff1_used~0_554 (ite .cse7 0 (ite (and .cse2 .cse4 .cse8 .cse9) v_~weak$$choice0~0_181 0))))) (= (store |v_#memory_int_653| |v_~#x~0.base_319| (store .cse10 |v_~#x~0.offset_319| |v_P2_#t~ite29_50|)) |v_#memory_int_652|) (= v_~weak$$choice1~0_198 |v_P2Thread1of1ForFork1_#t~nondet17_30|) (= (ite (= (ite .cse0 .cse11 (ite .cse12 .cse11 (ite (and .cse13 .cse14) 0 (ite (and .cse4 .cse13 .cse8 .cse9) (ite (or .cse6 .cse15) 1 0) .cse16)))) 0) 0 1) v_~x$w_buff0_used~0_600) (= .cse17 v_~x$mem_tmp~0_133) (let ((.cse18 (= |v_P2_#t~ite20_78| |v_P2Thread1of1ForFork1_#t~ite20_30|)) (.cse19 (= |v_P2_#t~ite24_70| |v_P2Thread1of1ForFork1_#t~ite24_30|)) (.cse20 (= |v_P2Thread1of1ForFork1_#t~mem21_30| |v_P2_#t~mem21_87|)) (.cse21 (= |v_P2_#t~ite23_78| |v_P2Thread1of1ForFork1_#t~ite23_30|)) (.cse22 (= |v_P2Thread1of1ForFork1_#t~mem19_30| |v_P2_#t~mem19_81|)) (.cse23 (= |v_P2_#t~ite22_84| |v_P2Thread1of1ForFork1_#t~ite22_30|))) (or (and (or (and .cse18 (= |v_P2_#t~ite25_60| v_~x$w_buff0~0_407) .cse19 .cse20 .cse21 .cse14 .cse22 .cse23) (and (or (and (or (and .cse6 (= |v_P2_#t~ite20_78| |v_P2_#t~mem19_81|) (= .cse17 |v_P2_#t~mem19_81|)) (and .cse24 .cse22 (= |v_P2_#t~ite20_78| (ite (not .cse15) v_~x$w_buff0~0_407 v_~x$w_buff1~0_366)))) .cse4 (= |v_P2_#t~ite20_78| |v_P2_#t~ite24_70|) .cse20 .cse21 .cse8 .cse23) (and (or (not .cse4) .cse25) .cse18 (= |v_P2_#t~ite24_70| |v_P2_#t~ite23_78|) (or (and (= |v_P2_#t~ite23_78| (ite .cse6 v_~x$w_buff1~0_366 v_~x$w_buff0~0_407)) .cse20 .cse8 .cse23) (and (or (and .cse6 (= |v_P2_#t~ite22_84| v_~x$w_buff0~0_407) .cse20) (and (= .cse17 |v_P2_#t~mem21_87|) (= |v_P2_#t~ite22_84| |v_P2_#t~mem21_87|) .cse24)) (= |v_P2_#t~ite22_84| |v_P2_#t~ite23_78|) .cse25)) .cse22)) (= |v_P2_#t~ite24_70| |v_P2_#t~ite25_60|) .cse9)) .cse13 (= |v_P2_#t~ite25_60| v_~__unbuffered_p2_EAX~0_269) (= |v_P2Thread1of1ForFork1_#t~mem18_30| |v_P2_#t~mem18_53|)) (and .cse18 .cse12 .cse19 .cse20 .cse21 (= |v_P2_#t~ite25_60| |v_P2Thread1of1ForFork1_#t~ite25_30|) (= |v_P2_#t~mem18_53| v_~__unbuffered_p2_EAX~0_269) .cse22 (= .cse17 |v_P2_#t~mem18_53|) .cse23))) (= v_~x$flush_delayed~0_159 0) (= v_~x$w_buff1~0_366 v_~x$w_buff1~0_365) (= v_~weak$$choice2~0_173 |v_P2Thread1of1ForFork1_#t~nondet15_30|) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_~x$w_buff0~0_407 v_~x$w_buff0~0_406) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_144 |v_~#x~0.base_319|) (or (and (= |v_P2_#t~mem28_51| v_~__unbuffered_p2_EAX~0_269) (= |v_P2_#t~ite29_50| |v_P2_#t~mem28_51|) .cse26) (and .cse0 (= |v_P2Thread1of1ForFork1_#t~mem28_30| |v_P2_#t~mem28_51|) (= |v_P2_#t~ite29_50| v_~x$mem_tmp~0_133))) (= |v_~#x~0.offset_319| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_144) (= v_~__unbuffered_p2_EAX$read_delayed~0_141 1) (= |v_P2Thread1of1ForFork1_#t~nondet14_30| v_~weak$$choice0~0_181) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|) (= v_~y~0_136 1) (= (ite .cse0 v_~x$r_buff0_thd3~0_219 (ite .cse1 v_~x$r_buff0_thd3~0_219 (ite .cse7 0 (ite (and .cse2 .cse4 .cse5 .cse9) v_~x$r_buff0_thd3~0_219 0)))) v_~x$r_buff0_thd3~0_218))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_407, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_30|, P2Thread1of1ForFork1_#t~mem18=|v_P2Thread1of1ForFork1_#t~mem18_30|, ~#x~0.offset=|v_~#x~0.offset_319|, P2Thread1of1ForFork1_#t~mem28=|v_P2Thread1of1ForFork1_#t~mem28_30|, ~x$w_buff1~0=v_~x$w_buff1~0_366, P2Thread1of1ForFork1_#t~nondet14=|v_P2Thread1of1ForFork1_#t~nondet14_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_219, P2Thread1of1ForFork1_#t~nondet17=|v_P2Thread1of1ForFork1_#t~nondet17_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_601, P2Thread1of1ForFork1_#t~nondet15=|v_P2Thread1of1ForFork1_#t~nondet15_30|, P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_30|, P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_30|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_30|, P2Thread1of1ForFork1_#t~ite22=|v_P2Thread1of1ForFork1_#t~ite22_30|, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_30|, #memory_int=|v_#memory_int_653|, ~#x~0.base=|v_~#x~0.base_319|, P2Thread1of1ForFork1_#t~mem21=|v_P2Thread1of1ForFork1_#t~mem21_30|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_406, ~x$flush_delayed~0=v_~x$flush_delayed~0_159, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_144, P2Thread1of1ForFork1_#t~mem16=|v_P2Thread1of1ForFork1_#t~mem16_17|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_144, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_133, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_218, ~weak$$choice1~0=v_~weak$$choice1~0_198, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_17|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_269, ~y~0=v_~y~0_136, P2Thread1of1ForFork1_#t~ite29=|v_P2Thread1of1ForFork1_#t~ite29_17|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, ~#x~0.offset=|v_~#x~0.offset_319|, P2Thread1of1ForFork1_#t~mem27=|v_P2Thread1of1ForFork1_#t~mem27_17|, ~x$w_buff1~0=v_~x$w_buff1~0_365, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_600, ~weak$$choice0~0=v_~weak$$choice0~0_181, #memory_int=|v_#memory_int_652|, ~#x~0.base=|v_~#x~0.base_319|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~weak$$choice2~0=v_~weak$$choice2~0_173} AuxVars[|v_P2_#t~mem28_51|, |v_P2_#t~ite22_84|, |v_P2_#t~mem19_81|, |v_P2_#t~ite29_50|, |v_P2_#t~ite23_78|, |v_P2_#t~ite20_78|, |v_P2_#t~ite24_70|, |v_P2_#t~ite25_60|, |v_P2_#t~mem18_53|, |v_P2_#t~mem21_87|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~mem18, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork1_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite25, ~weak$$choice1~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork1_#t~ite22, P2Thread1of1ForFork1_#t~ite23, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_#t~ite29, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem28, P2Thread1of1ForFork1_#t~mem27, ~x$w_buff1~0, P2Thread1of1ForFork1_#t~nondet14, ~x$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet17, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet15, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork1_#t~mem21, ~weak$$choice2~0] and [888] $Ultimate##0-->L778: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd1~0_252 256) 0)) (.cse3 (= (mod v_~x$w_buff1_used~0_566 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_613 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd1~0_246 256) 0))) (let ((.cse12 (= 0 (mod v_~weak$$choice2~0_179 256))) (.cse7 (select |v_#memory_int_665| |v_~#x~0.base_325|)) (.cse1 (not .cse14)) (.cse4 (not .cse16)) (.cse9 (and .cse3 .cse14)) (.cse10 (and .cse2 .cse14))) (let ((.cse5 (or .cse16 .cse9 .cse10)) (.cse0 (and .cse1 .cse4)) (.cse6 (select .cse7 |v_~#x~0.offset_325|)) (.cse8 (not .cse12)) (.cse13 (= 0 (mod v_~x$w_buff1_used~0_565 256))) (.cse11 (= (mod v_~x$w_buff0_used~0_612 256) 0))) (and (or (and (= (ite .cse0 v_~x$w_buff0~0_419 v_~x$w_buff1~0_378) v_~__unbuffered_p0_EAX~0_180) (or .cse1 (not .cse2)) (or .cse1 (not .cse3)) (= |v_P0Thread1of1ForFork2_#t~mem6_156| |v_P0_#t~mem6_123|) .cse4) (and (= v_~__unbuffered_p0_EAX~0_180 |v_P0_#t~mem6_123|) .cse5 (= |v_P0_#t~mem6_123| .cse6))) (= v_~x$w_buff1~0_378 v_~x$w_buff1~0_377) (= v_~weak$$choice2~0_179 |v_P0Thread1of1ForFork2_#t~nondet4_156|) (= v_~y~0_142 2) (= (store |v_#memory_int_665| |v_~#x~0.base_325| (store .cse7 |v_~#x~0.offset_325| |v_P0_#t~ite10_122|)) |v_#memory_int_664|) (= (ite .cse8 v_~x$w_buff1_used~0_566 (ite (or .cse9 .cse10 .cse11) v_~x$w_buff1_used~0_566 0)) v_~x$w_buff1_used~0_565) (= v_~x$w_buff0_used~0_612 (ite .cse8 v_~x$w_buff0_used~0_613 (ite .cse5 v_~x$w_buff0_used~0_613 (ite .cse0 0 v_~x$w_buff0_used~0_613)))) (= v_~x$w_buff0~0_419 v_~x$w_buff0~0_418) (= .cse6 v_~x$mem_tmp~0_139) (= v_~weak$$choice0~0_187 |v_P0Thread1of1ForFork2_#t~nondet3_156|) (or (and .cse8 (= |v_P0_#t~ite10_122| v_~x$mem_tmp~0_139) (= |v_P0Thread1of1ForFork2_#t~mem9_156| |v_P0_#t~mem9_121|)) (and .cse12 (= v_~__unbuffered_p0_EAX~0_180 |v_P0_#t~mem9_121|) (= |v_P0_#t~ite10_122| |v_P0_#t~mem9_121|))) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_~x$r_buff0_thd1~0_245 (ite .cse8 v_~x$r_buff0_thd1~0_246 (ite (or .cse10 .cse11 (and .cse13 .cse14)) v_~x$r_buff0_thd1~0_246 (ite (and .cse1 (not .cse11)) 0 v_~x$r_buff0_thd1~0_246)))) (= v_~x$r_buff1_thd1~0_251 (ite .cse8 v_~x$r_buff1_thd1~0_252 (ite (let ((.cse15 (= (mod v_~x$r_buff0_thd1~0_245 256) 0))) (or (and .cse15 .cse13) (and .cse2 .cse15) .cse11)) v_~x$r_buff1_thd1~0_252 0))) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|) (= v_~x$flush_delayed~0_165 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_419, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_246, ~#x~0.offset=|v_~#x~0.offset_325|, ~x$w_buff1~0=v_~x$w_buff1~0_378, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_566, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_252, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_156|, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_156|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_613, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, #memory_int=|v_#memory_int_665|, ~#x~0.base=|v_~#x~0.base_325|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_156|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_156|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_418, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_245, ~x$flush_delayed~0=v_~x$flush_delayed~0_165, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_251, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_80|, ~x$mem_tmp~0=v_~x$mem_tmp~0_139, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_80|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_180, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, ~y~0=v_~y~0_142, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_80|, ~#x~0.offset=|v_~#x~0.offset_325|, ~x$w_buff1~0=v_~x$w_buff1~0_377, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_565, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612, ~weak$$choice0~0=v_~weak$$choice0~0_187, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_80|, #memory_int=|v_#memory_int_664|, ~#x~0.base=|v_~#x~0.base_325|, ~weak$$choice2~0=v_~weak$$choice2~0_179} AuxVars[|v_P0_#t~mem9_121|, |v_P0_#t~ite10_122|, |v_P0_#t~mem6_123|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite7, P0Thread1of1ForFork2_~arg.offset, #memory_int, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork2_#t~ite10] [2022-12-13 00:52:57,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [885] $Ultimate##0-->L835: Formula: (let ((.cse16 (mod v_~weak$$choice0~0_181 256)) (.cse11 (mod v_~x$w_buff0_used~0_601 256)) (.cse9 (= (mod v_~x$r_buff0_thd3~0_219 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_600 256) 0))) (let ((.cse2 (not .cse1)) (.cse14 (not .cse9)) (.cse26 (= (mod v_~weak$$choice2~0_173 256) 0)) (.cse10 (select |v_#memory_int_653| |v_~#x~0.base_319|)) (.cse12 (= .cse11 0)) (.cse24 (= .cse16 0)) (.cse25 (= (mod v_~x$w_buff1_used~0_554 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice1~0_198 256) 0)) (.cse8 (not .cse25)) (.cse6 (not .cse24)) (.cse13 (not .cse12)) (.cse17 (select .cse10 |v_~#x~0.offset_319|)) (.cse0 (not .cse26)) (.cse7 (and .cse2 .cse14)) (.cse4 (= (mod v_~x$r_buff1_thd3~0_213 256) 0)) (.cse5 (not (= (mod v_~x$w_buff1_used~0_553 256) 0)))) (and (= (ite .cse0 v_~x$r_buff1_thd3~0_213 (ite .cse1 v_~x$r_buff1_thd3~0_213 (let ((.cse3 (= (mod v_~x$r_buff0_thd3~0_218 256) 0))) (ite (and .cse2 (not .cse3)) 0 (ite (and .cse3 .cse2 .cse4 .cse5) (ite .cse6 v_~x$r_buff1_thd3~0_213 0) 0))))) v_~x$r_buff1_thd3~0_212) (= v_~x$w_buff1_used~0_553 (ite .cse0 v_~x$w_buff1_used~0_554 (ite .cse1 v_~x$w_buff1_used~0_554 (ite .cse7 0 (ite (and .cse2 .cse4 .cse8 .cse9) v_~weak$$choice0~0_181 0))))) (= (store |v_#memory_int_653| |v_~#x~0.base_319| (store .cse10 |v_~#x~0.offset_319| |v_P2_#t~ite29_50|)) |v_#memory_int_652|) (= v_~weak$$choice1~0_198 |v_P2Thread1of1ForFork1_#t~nondet17_30|) (= (ite (= (ite .cse0 .cse11 (ite .cse12 .cse11 (ite (and .cse13 .cse14) 0 (ite (and .cse4 .cse13 .cse8 .cse9) (ite (or .cse6 .cse15) 1 0) .cse16)))) 0) 0 1) v_~x$w_buff0_used~0_600) (= .cse17 v_~x$mem_tmp~0_133) (let ((.cse18 (= |v_P2_#t~ite20_78| |v_P2Thread1of1ForFork1_#t~ite20_30|)) (.cse19 (= |v_P2_#t~ite24_70| |v_P2Thread1of1ForFork1_#t~ite24_30|)) (.cse20 (= |v_P2Thread1of1ForFork1_#t~mem21_30| |v_P2_#t~mem21_87|)) (.cse21 (= |v_P2_#t~ite23_78| |v_P2Thread1of1ForFork1_#t~ite23_30|)) (.cse22 (= |v_P2Thread1of1ForFork1_#t~mem19_30| |v_P2_#t~mem19_81|)) (.cse23 (= |v_P2_#t~ite22_84| |v_P2Thread1of1ForFork1_#t~ite22_30|))) (or (and (or (and .cse18 (= |v_P2_#t~ite25_60| v_~x$w_buff0~0_407) .cse19 .cse20 .cse21 .cse14 .cse22 .cse23) (and (or (and (or (and .cse6 (= |v_P2_#t~ite20_78| |v_P2_#t~mem19_81|) (= .cse17 |v_P2_#t~mem19_81|)) (and .cse24 .cse22 (= |v_P2_#t~ite20_78| (ite (not .cse15) v_~x$w_buff0~0_407 v_~x$w_buff1~0_366)))) .cse4 (= |v_P2_#t~ite20_78| |v_P2_#t~ite24_70|) .cse20 .cse21 .cse8 .cse23) (and (or (not .cse4) .cse25) .cse18 (= |v_P2_#t~ite24_70| |v_P2_#t~ite23_78|) (or (and (= |v_P2_#t~ite23_78| (ite .cse6 v_~x$w_buff1~0_366 v_~x$w_buff0~0_407)) .cse20 .cse8 .cse23) (and (or (and .cse6 (= |v_P2_#t~ite22_84| v_~x$w_buff0~0_407) .cse20) (and (= .cse17 |v_P2_#t~mem21_87|) (= |v_P2_#t~ite22_84| |v_P2_#t~mem21_87|) .cse24)) (= |v_P2_#t~ite22_84| |v_P2_#t~ite23_78|) .cse25)) .cse22)) (= |v_P2_#t~ite24_70| |v_P2_#t~ite25_60|) .cse9)) .cse13 (= |v_P2_#t~ite25_60| v_~__unbuffered_p2_EAX~0_269) (= |v_P2Thread1of1ForFork1_#t~mem18_30| |v_P2_#t~mem18_53|)) (and .cse18 .cse12 .cse19 .cse20 .cse21 (= |v_P2_#t~ite25_60| |v_P2Thread1of1ForFork1_#t~ite25_30|) (= |v_P2_#t~mem18_53| v_~__unbuffered_p2_EAX~0_269) .cse22 (= .cse17 |v_P2_#t~mem18_53|) .cse23))) (= v_~x$flush_delayed~0_159 0) (= v_~x$w_buff1~0_366 v_~x$w_buff1~0_365) (= v_~weak$$choice2~0_173 |v_P2Thread1of1ForFork1_#t~nondet15_30|) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_~x$w_buff0~0_407 v_~x$w_buff0~0_406) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_144 |v_~#x~0.base_319|) (or (and (= |v_P2_#t~mem28_51| v_~__unbuffered_p2_EAX~0_269) (= |v_P2_#t~ite29_50| |v_P2_#t~mem28_51|) .cse26) (and .cse0 (= |v_P2Thread1of1ForFork1_#t~mem28_30| |v_P2_#t~mem28_51|) (= |v_P2_#t~ite29_50| v_~x$mem_tmp~0_133))) (= |v_~#x~0.offset_319| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_144) (= v_~__unbuffered_p2_EAX$read_delayed~0_141 1) (= |v_P2Thread1of1ForFork1_#t~nondet14_30| v_~weak$$choice0~0_181) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|) (= v_~y~0_136 1) (= (ite .cse0 v_~x$r_buff0_thd3~0_219 (ite .cse1 v_~x$r_buff0_thd3~0_219 (ite .cse7 0 (ite (and .cse2 .cse4 .cse5 .cse9) v_~x$r_buff0_thd3~0_219 0)))) v_~x$r_buff0_thd3~0_218))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_407, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_30|, P2Thread1of1ForFork1_#t~mem18=|v_P2Thread1of1ForFork1_#t~mem18_30|, ~#x~0.offset=|v_~#x~0.offset_319|, P2Thread1of1ForFork1_#t~mem28=|v_P2Thread1of1ForFork1_#t~mem28_30|, ~x$w_buff1~0=v_~x$w_buff1~0_366, P2Thread1of1ForFork1_#t~nondet14=|v_P2Thread1of1ForFork1_#t~nondet14_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_219, P2Thread1of1ForFork1_#t~nondet17=|v_P2Thread1of1ForFork1_#t~nondet17_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_601, P2Thread1of1ForFork1_#t~nondet15=|v_P2Thread1of1ForFork1_#t~nondet15_30|, P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_30|, P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_30|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_30|, P2Thread1of1ForFork1_#t~ite22=|v_P2Thread1of1ForFork1_#t~ite22_30|, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_30|, #memory_int=|v_#memory_int_653|, ~#x~0.base=|v_~#x~0.base_319|, P2Thread1of1ForFork1_#t~mem21=|v_P2Thread1of1ForFork1_#t~mem21_30|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_406, ~x$flush_delayed~0=v_~x$flush_delayed~0_159, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_144, P2Thread1of1ForFork1_#t~mem16=|v_P2Thread1of1ForFork1_#t~mem16_17|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_144, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_133, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_218, ~weak$$choice1~0=v_~weak$$choice1~0_198, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_17|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_269, ~y~0=v_~y~0_136, P2Thread1of1ForFork1_#t~ite29=|v_P2Thread1of1ForFork1_#t~ite29_17|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, ~#x~0.offset=|v_~#x~0.offset_319|, P2Thread1of1ForFork1_#t~mem27=|v_P2Thread1of1ForFork1_#t~mem27_17|, ~x$w_buff1~0=v_~x$w_buff1~0_365, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_600, ~weak$$choice0~0=v_~weak$$choice0~0_181, #memory_int=|v_#memory_int_652|, ~#x~0.base=|v_~#x~0.base_319|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~weak$$choice2~0=v_~weak$$choice2~0_173} AuxVars[|v_P2_#t~mem28_51|, |v_P2_#t~ite22_84|, |v_P2_#t~mem19_81|, |v_P2_#t~ite29_50|, |v_P2_#t~ite23_78|, |v_P2_#t~ite20_78|, |v_P2_#t~ite24_70|, |v_P2_#t~ite25_60|, |v_P2_#t~mem18_53|, |v_P2_#t~mem21_87|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~mem18, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork1_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite25, ~weak$$choice1~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork1_#t~ite22, P2Thread1of1ForFork1_#t~ite23, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_#t~ite29, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem28, P2Thread1of1ForFork1_#t~mem27, ~x$w_buff1~0, P2Thread1of1ForFork1_#t~nondet14, ~x$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet17, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet15, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork1_#t~mem21, ~weak$$choice2~0] and [889] $Ultimate##0-->L806: Formula: (let ((.cse12 (= (mod v_~x$w_buff0_used~0_617 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_250 256) 0)) (.cse7 (= (mod v_~weak$$choice2~0_181 256) 0))) (let ((.cse8 (not .cse7)) (.cse15 (and .cse12 .cse6)) (.cse4 (not .cse6))) (let ((.cse13 (ite .cse8 1 (ite (or .cse6 .cse15) 1 (ite .cse4 0 1))))) (let ((.cse10 (= (mod .cse13 256) 0))) (let ((.cse14 (select |v_#memory_int_669| |v_~#x~0.base_327|)) (.cse3 (ite .cse8 v_~x$w_buff0_used~0_617 (ite (or .cse6 .cse15 .cse10) v_~x$w_buff0_used~0_617 0)))) (let ((.cse1 (not (= (mod v_~x$r_buff0_thd2~0_182 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_616 256) 0))) (.cse2 (= (mod .cse3 256) 0)) (.cse5 (select .cse14 |v_~#x~0.offset_327|)) (.cse11 (not .cse10))) (and (= (ite (or .cse0 (and .cse1 (not .cse2))) 0 .cse3) v_~x$w_buff1_used~0_569) (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= |v_P1Thread1of1ForFork0_~arg#1.base_40| |v_P1Thread1of1ForFork0_#in~arg#1.base_40|) (or (and .cse4 (= (ite .cse4 v_~x$w_buff0~0_422 v_~x$w_buff1~0_381) v_~__unbuffered_p0_EAX~0_182) (= |v_P0Thread1of1ForFork2_#t~mem6_160| |v_P0_#t~mem6_125|)) (and (= |v_P0_#t~mem6_125| .cse5) (= v_~__unbuffered_p0_EAX~0_182 |v_P0_#t~mem6_125|) .cse6)) (= v_~weak$$choice2~0_181 |v_P0Thread1of1ForFork2_#t~nondet4_160|) (= v_~x$flush_delayed~0_167 0) (or (and (= v_~__unbuffered_p0_EAX~0_182 |v_P0_#t~mem9_123|) (= |v_P0_#t~ite10_124| |v_P0_#t~mem9_123|) .cse7) (and (= |v_P0Thread1of1ForFork2_#t~mem9_160| |v_P0_#t~mem9_123|) (= |v_P0_#t~ite10_124| v_~x$mem_tmp~0_141) .cse8)) (= (ite .cse0 0 1) v_~x$r_buff0_thd2~0_181) (= v_~x$r_buff1_thd1~0_255 (ite .cse8 v_~x$r_buff0_thd1~0_250 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_249 256) 0))) (or (and .cse2 .cse9) .cse10 (and .cse9 .cse6))) v_~x$r_buff0_thd1~0_250 0))) (= v_~x$r_buff0_thd3~0_226 v_~x$r_buff1_thd3~0_220) (= v_~x$r_buff1_thd2~0_133 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_569 256) 0))) (and .cse0 (not (= (mod v_~x$r_buff0_thd2~0_181 256) 0)))) 0 v_~x$r_buff0_thd2~0_182)) (= v_~weak$$choice0~0_189 |v_P0Thread1of1ForFork2_#t~nondet3_160|) (= (ite .cse8 v_~x$r_buff0_thd1~0_250 (ite (or (and .cse2 .cse6) .cse6 .cse10) v_~x$r_buff0_thd1~0_250 (ite (and .cse4 .cse11) 0 v_~x$r_buff0_thd1~0_250))) v_~x$r_buff0_thd1~0_249) (= v_~y~0_144 2) (= v_~x$r_buff0_thd0~0_186 v_~x$r_buff1_thd0~0_196) (= (ite .cse12 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_~x$w_buff0_used~0_616 (ite .cse11 0 .cse13)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| 0)) (= v_~x$w_buff0~0_422 1) (= v_~x$w_buff0~0_423 v_~x$w_buff1~0_381) (= .cse5 v_~x$mem_tmp~0_141) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_40| |v_P1Thread1of1ForFork0_~arg#1.offset_40|) (or (and (= |v_P1_#t~mem11#1_56| |v_P1Thread1of1ForFork0_#t~mem11#1_38|) (= |v_P1Thread1of1ForFork0_#t~ite12#1_38| |v_P1_#t~ite12#1_53|) .cse11 (= v_~x$w_buff0~0_422 |v_P1_#t~ite13#1_43|)) (and (= |v_P1_#t~ite12#1_53| |v_P1_#t~ite13#1_43|) (= |v_P1_#t~mem11#1_56| |v_P1_#t~ite12#1_53|) .cse10 (= |v_P1_#t~mem11#1_56| |v_P0_#t~ite10_124|))) (= (store |v_#memory_int_669| |v_~#x~0.base_327| (store .cse14 |v_~#x~0.offset_327| |v_P1_#t~ite13#1_43|)) |v_#memory_int_668|)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_423, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_250, ~#x~0.offset=|v_~#x~0.offset_327|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_226, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_160|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_182, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_160|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_617, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, #memory_int=|v_#memory_int_669|, ~#x~0.base=|v_~#x~0.base_327|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_160|, P1Thread1of1ForFork0_#t~mem11#1=|v_P1Thread1of1ForFork0_#t~mem11#1_38|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_160|, P1Thread1of1ForFork0_#t~ite12#1=|v_P1Thread1of1ForFork0_#t~ite12#1_38|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_422, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_249, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_40|, ~x$flush_delayed~0=v_~x$flush_delayed~0_167, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_220, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_255, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_82|, ~x$mem_tmp~0=v_~x$mem_tmp~0_141, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_226, P1Thread1of1ForFork0_#t~ite13#1=|v_P1Thread1of1ForFork0_#t~ite13#1_21|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_82|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, ~y~0=v_~y~0_144, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_82|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_186, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_40|, ~#x~0.offset=|v_~#x~0.offset_327|, ~x$w_buff1~0=v_~x$w_buff1~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_133, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_569, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_181, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_196, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_616, ~weak$$choice0~0=v_~weak$$choice0~0_189, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_82|, #memory_int=|v_#memory_int_668|, ~#x~0.base=|v_~#x~0.base_327|, ~weak$$choice2~0=v_~weak$$choice2~0_181} AuxVars[|v_P1_#t~mem11#1_56|, |v_P1_#t~ite12#1_53|, |v_P0_#t~mem9_123|, |v_P0_#t~ite10_124|, |v_P0_#t~mem6_125|, |v_P1_#t~ite13#1_43|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P1Thread1of1ForFork0_#t~ite13#1, P0Thread1of1ForFork2_#t~mem5, P0Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P1Thread1of1ForFork0_#t~mem11#1, P0Thread1of1ForFork2_#t~nondet3, P1Thread1of1ForFork0_#t~ite12#1] [2022-12-13 00:53:00,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [885] $Ultimate##0-->L835: Formula: (let ((.cse16 (mod v_~weak$$choice0~0_181 256)) (.cse11 (mod v_~x$w_buff0_used~0_601 256)) (.cse9 (= (mod v_~x$r_buff0_thd3~0_219 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_600 256) 0))) (let ((.cse2 (not .cse1)) (.cse14 (not .cse9)) (.cse26 (= (mod v_~weak$$choice2~0_173 256) 0)) (.cse10 (select |v_#memory_int_653| |v_~#x~0.base_319|)) (.cse12 (= .cse11 0)) (.cse24 (= .cse16 0)) (.cse25 (= (mod v_~x$w_buff1_used~0_554 256) 0))) (let ((.cse15 (= (mod v_~weak$$choice1~0_198 256) 0)) (.cse8 (not .cse25)) (.cse6 (not .cse24)) (.cse13 (not .cse12)) (.cse17 (select .cse10 |v_~#x~0.offset_319|)) (.cse0 (not .cse26)) (.cse7 (and .cse2 .cse14)) (.cse4 (= (mod v_~x$r_buff1_thd3~0_213 256) 0)) (.cse5 (not (= (mod v_~x$w_buff1_used~0_553 256) 0)))) (and (= (ite .cse0 v_~x$r_buff1_thd3~0_213 (ite .cse1 v_~x$r_buff1_thd3~0_213 (let ((.cse3 (= (mod v_~x$r_buff0_thd3~0_218 256) 0))) (ite (and .cse2 (not .cse3)) 0 (ite (and .cse3 .cse2 .cse4 .cse5) (ite .cse6 v_~x$r_buff1_thd3~0_213 0) 0))))) v_~x$r_buff1_thd3~0_212) (= v_~x$w_buff1_used~0_553 (ite .cse0 v_~x$w_buff1_used~0_554 (ite .cse1 v_~x$w_buff1_used~0_554 (ite .cse7 0 (ite (and .cse2 .cse4 .cse8 .cse9) v_~weak$$choice0~0_181 0))))) (= (store |v_#memory_int_653| |v_~#x~0.base_319| (store .cse10 |v_~#x~0.offset_319| |v_P2_#t~ite29_50|)) |v_#memory_int_652|) (= v_~weak$$choice1~0_198 |v_P2Thread1of1ForFork1_#t~nondet17_30|) (= (ite (= (ite .cse0 .cse11 (ite .cse12 .cse11 (ite (and .cse13 .cse14) 0 (ite (and .cse4 .cse13 .cse8 .cse9) (ite (or .cse6 .cse15) 1 0) .cse16)))) 0) 0 1) v_~x$w_buff0_used~0_600) (= .cse17 v_~x$mem_tmp~0_133) (let ((.cse18 (= |v_P2_#t~ite20_78| |v_P2Thread1of1ForFork1_#t~ite20_30|)) (.cse19 (= |v_P2_#t~ite24_70| |v_P2Thread1of1ForFork1_#t~ite24_30|)) (.cse20 (= |v_P2Thread1of1ForFork1_#t~mem21_30| |v_P2_#t~mem21_87|)) (.cse21 (= |v_P2_#t~ite23_78| |v_P2Thread1of1ForFork1_#t~ite23_30|)) (.cse22 (= |v_P2Thread1of1ForFork1_#t~mem19_30| |v_P2_#t~mem19_81|)) (.cse23 (= |v_P2_#t~ite22_84| |v_P2Thread1of1ForFork1_#t~ite22_30|))) (or (and (or (and .cse18 (= |v_P2_#t~ite25_60| v_~x$w_buff0~0_407) .cse19 .cse20 .cse21 .cse14 .cse22 .cse23) (and (or (and (or (and .cse6 (= |v_P2_#t~ite20_78| |v_P2_#t~mem19_81|) (= .cse17 |v_P2_#t~mem19_81|)) (and .cse24 .cse22 (= |v_P2_#t~ite20_78| (ite (not .cse15) v_~x$w_buff0~0_407 v_~x$w_buff1~0_366)))) .cse4 (= |v_P2_#t~ite20_78| |v_P2_#t~ite24_70|) .cse20 .cse21 .cse8 .cse23) (and (or (not .cse4) .cse25) .cse18 (= |v_P2_#t~ite24_70| |v_P2_#t~ite23_78|) (or (and (= |v_P2_#t~ite23_78| (ite .cse6 v_~x$w_buff1~0_366 v_~x$w_buff0~0_407)) .cse20 .cse8 .cse23) (and (or (and .cse6 (= |v_P2_#t~ite22_84| v_~x$w_buff0~0_407) .cse20) (and (= .cse17 |v_P2_#t~mem21_87|) (= |v_P2_#t~ite22_84| |v_P2_#t~mem21_87|) .cse24)) (= |v_P2_#t~ite22_84| |v_P2_#t~ite23_78|) .cse25)) .cse22)) (= |v_P2_#t~ite24_70| |v_P2_#t~ite25_60|) .cse9)) .cse13 (= |v_P2_#t~ite25_60| v_~__unbuffered_p2_EAX~0_269) (= |v_P2Thread1of1ForFork1_#t~mem18_30| |v_P2_#t~mem18_53|)) (and .cse18 .cse12 .cse19 .cse20 .cse21 (= |v_P2_#t~ite25_60| |v_P2Thread1of1ForFork1_#t~ite25_30|) (= |v_P2_#t~mem18_53| v_~__unbuffered_p2_EAX~0_269) .cse22 (= .cse17 |v_P2_#t~mem18_53|) .cse23))) (= v_~x$flush_delayed~0_159 0) (= v_~x$w_buff1~0_366 v_~x$w_buff1~0_365) (= v_~weak$$choice2~0_173 |v_P2Thread1of1ForFork1_#t~nondet15_30|) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_~x$w_buff0~0_407 v_~x$w_buff0~0_406) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_144 |v_~#x~0.base_319|) (or (and (= |v_P2_#t~mem28_51| v_~__unbuffered_p2_EAX~0_269) (= |v_P2_#t~ite29_50| |v_P2_#t~mem28_51|) .cse26) (and .cse0 (= |v_P2Thread1of1ForFork1_#t~mem28_30| |v_P2_#t~mem28_51|) (= |v_P2_#t~ite29_50| v_~x$mem_tmp~0_133))) (= |v_~#x~0.offset_319| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_144) (= v_~__unbuffered_p2_EAX$read_delayed~0_141 1) (= |v_P2Thread1of1ForFork1_#t~nondet14_30| v_~weak$$choice0~0_181) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|) (= v_~y~0_136 1) (= (ite .cse0 v_~x$r_buff0_thd3~0_219 (ite .cse1 v_~x$r_buff0_thd3~0_219 (ite .cse7 0 (ite (and .cse2 .cse4 .cse5 .cse9) v_~x$r_buff0_thd3~0_219 0)))) v_~x$r_buff0_thd3~0_218))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_407, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_30|, P2Thread1of1ForFork1_#t~mem18=|v_P2Thread1of1ForFork1_#t~mem18_30|, ~#x~0.offset=|v_~#x~0.offset_319|, P2Thread1of1ForFork1_#t~mem28=|v_P2Thread1of1ForFork1_#t~mem28_30|, ~x$w_buff1~0=v_~x$w_buff1~0_366, P2Thread1of1ForFork1_#t~nondet14=|v_P2Thread1of1ForFork1_#t~nondet14_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_219, P2Thread1of1ForFork1_#t~nondet17=|v_P2Thread1of1ForFork1_#t~nondet17_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_601, P2Thread1of1ForFork1_#t~nondet15=|v_P2Thread1of1ForFork1_#t~nondet15_30|, P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_30|, P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_30|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_30|, P2Thread1of1ForFork1_#t~ite22=|v_P2Thread1of1ForFork1_#t~ite22_30|, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_30|, #memory_int=|v_#memory_int_653|, ~#x~0.base=|v_~#x~0.base_319|, P2Thread1of1ForFork1_#t~mem21=|v_P2Thread1of1ForFork1_#t~mem21_30|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_406, ~x$flush_delayed~0=v_~x$flush_delayed~0_159, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_144, P2Thread1of1ForFork1_#t~mem16=|v_P2Thread1of1ForFork1_#t~mem16_17|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_144, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_133, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_218, ~weak$$choice1~0=v_~weak$$choice1~0_198, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_17|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_269, ~y~0=v_~y~0_136, P2Thread1of1ForFork1_#t~ite29=|v_P2Thread1of1ForFork1_#t~ite29_17|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, ~#x~0.offset=|v_~#x~0.offset_319|, P2Thread1of1ForFork1_#t~mem27=|v_P2Thread1of1ForFork1_#t~mem27_17|, ~x$w_buff1~0=v_~x$w_buff1~0_365, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_141, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_600, ~weak$$choice0~0=v_~weak$$choice0~0_181, #memory_int=|v_#memory_int_652|, ~#x~0.base=|v_~#x~0.base_319|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~weak$$choice2~0=v_~weak$$choice2~0_173} AuxVars[|v_P2_#t~mem28_51|, |v_P2_#t~ite22_84|, |v_P2_#t~mem19_81|, |v_P2_#t~ite29_50|, |v_P2_#t~ite23_78|, |v_P2_#t~ite20_78|, |v_P2_#t~ite24_70|, |v_P2_#t~ite25_60|, |v_P2_#t~mem18_53|, |v_P2_#t~mem21_87|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~mem18, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork1_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite25, ~weak$$choice1~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork1_#t~ite22, P2Thread1of1ForFork1_#t~ite23, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_#t~ite29, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem28, P2Thread1of1ForFork1_#t~mem27, ~x$w_buff1~0, P2Thread1of1ForFork1_#t~nondet14, ~x$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet17, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~nondet15, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork1_#t~mem21, ~weak$$choice2~0] and [891] $Ultimate##0-->L842: Formula: (let ((.cse4 (= (mod v_~x$w_buff0_used~0_625 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_258 256) 0)) (.cse2 (= (mod v_~weak$$choice2~0_185 256) 0))) (let ((.cse3 (not .cse2)) (.cse17 (and .cse4 .cse6)) (.cse11 (not .cse6))) (let ((.cse14 (ite .cse3 1 (ite (or .cse6 .cse17) 1 (ite .cse11 0 1))))) (let ((.cse5 (= (mod .cse14 256) 0)) (.cse15 (= (mod v_~x$r_buff0_thd3~0_231 256) 0))) (let ((.cse16 (select |v_#memory_int_677| |v_~#x~0.base_331|)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_624 256) 0))) (.cse1 (not .cse15)) (.cse13 (ite .cse3 v_~x$w_buff0_used~0_625 (ite (or .cse5 .cse6 .cse17) v_~x$w_buff0_used~0_625 0)))) (let ((.cse8 (= (mod .cse13 256) 0)) (.cse12 (and .cse0 .cse1)) (.cse10 (not .cse5)) (.cse9 (select .cse16 |v_~#x~0.offset_331|))) (and (= v_~x$w_buff0~0_431 v_~x$w_buff1~0_385) (= v_~y~0_148 2) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd3~0_230 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_573 256) 0)) .cse1)) 0 v_~x$r_buff0_thd3~0_231) v_~x$r_buff1_thd3~0_224) (= v_~x$r_buff0_thd0~0_190 v_~x$r_buff1_thd0~0_200) (or (and .cse2 (= |v_P0_#t~ite10_128| |v_P0_#t~mem9_127|) (= v_~__unbuffered_p0_EAX~0_186 |v_P0_#t~mem9_127|)) (and (= |v_P0Thread1of1ForFork2_#t~mem9_168| |v_P0_#t~mem9_127|) (= |v_P0_#t~ite10_128| v_~x$mem_tmp~0_145) .cse3)) (= |v_P0Thread1of1ForFork2_#in~arg.offset_25| v_P0Thread1of1ForFork2_~arg.offset_25) (= v_~x$w_buff0~0_430 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_44| |v_P1Thread1of1ForFork0_#in~arg#1.base_44|) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|) (= v_~weak$$choice2~0_185 |v_P0Thread1of1ForFork2_#t~nondet4_168|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_46| 0)) (= v_~x$r_buff1_thd1~0_259 (ite .cse3 v_~x$r_buff0_thd1~0_258 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_257 256) 0))) (or .cse5 (and .cse6 .cse7) (and .cse7 .cse8))) v_~x$r_buff0_thd1~0_258 0))) (= .cse9 v_~x$mem_tmp~0_145) (= v_~x$r_buff0_thd1~0_257 (ite .cse3 v_~x$r_buff0_thd1~0_258 (ite (or .cse5 .cse6 (and .cse6 .cse8)) v_~x$r_buff0_thd1~0_258 (ite (and .cse10 .cse11) 0 v_~x$r_buff0_thd1~0_258)))) (= (ite (or .cse12 (and (not .cse8) .cse1)) 0 .cse13) v_~x$w_buff1_used~0_573) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_44| |v_P1Thread1of1ForFork0_~arg#1.offset_44|) (= v_~x$r_buff0_thd2~0_189 1) (= v_~x$r_buff0_thd2~0_190 v_~x$r_buff1_thd2~0_137) (= v_~weak$$choice0~0_193 |v_P0Thread1of1ForFork2_#t~nondet3_168|) (= (ite (and .cse10 .cse1) 0 .cse14) v_~x$w_buff0_used~0_624) (= v_P0Thread1of1ForFork2_~arg.base_25 |v_P0Thread1of1ForFork2_#in~arg.base_25|) (= (ite .cse12 0 v_~x$r_buff0_thd3~0_231) v_~x$r_buff0_thd3~0_230) (or (and .cse10 (= |v_P2Thread1of1ForFork1_#t~mem30_34| |v_P2_#t~mem30_50|) (= |v_P2_#t~ite31_47| |v_P2Thread1of1ForFork1_#t~ite31_34|) (= |v_P2_#t~ite32_47| v_~x$w_buff0~0_430) .cse1) (and (= |v_P2_#t~ite31_47| |v_P2_#t~mem30_50|) (= |v_P2_#t~ite31_47| |v_P2_#t~ite32_47|) (or .cse5 .cse15) (= |v_P0_#t~ite10_128| |v_P2_#t~mem30_50|))) (= v_~x$flush_delayed~0_171 0) (or (and (= (ite .cse11 v_~x$w_buff0~0_430 v_~x$w_buff1~0_385) v_~__unbuffered_p0_EAX~0_186) .cse11 (= |v_P0Thread1of1ForFork2_#t~mem6_168| |v_P0_#t~mem6_129|)) (and (= |v_P0_#t~mem6_129| .cse9) .cse6 (= v_~__unbuffered_p0_EAX~0_186 |v_P0_#t~mem6_129|))) (= (store |v_#memory_int_677| |v_~#x~0.base_331| (store .cse16 |v_~#x~0.offset_331| |v_P2_#t~ite32_47|)) |v_#memory_int_676|)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_431, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_258, ~#x~0.offset=|v_~#x~0.offset_331|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_231, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_168|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_190, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_168|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_625, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_34|, #memory_int=|v_#memory_int_677|, ~#x~0.base=|v_~#x~0.base_331|, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_34|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_168|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_168|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_430, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_257, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_171, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_224, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_259, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_86|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_230, ~x$mem_tmp~0=v_~x$mem_tmp~0_145, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_46|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_44|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_86|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_25, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_186, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_25|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_25, ~y~0=v_~y~0_148, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_86|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_46|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_44|, ~#x~0.offset=|v_~#x~0.offset_331|, ~x$w_buff1~0=v_~x$w_buff1~0_385, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_573, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_137, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_25|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_189, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_200, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, ~weak$$choice0~0=v_~weak$$choice0~0_193, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_86|, #memory_int=|v_#memory_int_676|, ~#x~0.base=|v_~#x~0.base_331|, ~weak$$choice2~0=v_~weak$$choice2~0_185} AuxVars[|v_P0_#t~mem6_129|, |v_P0_#t~ite10_128|, |v_P2_#t~ite32_47|, |v_P0_#t~mem9_127|, |v_P2_#t~mem30_50|, |v_P2_#t~ite31_47|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, P0Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P2Thread1of1ForFork1_#t~mem30, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P2Thread1of1ForFork1_#t~ite32, P0Thread1of1ForFork2_#t~ite7, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:53:07,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] $Ultimate##0-->L778: Formula: (let ((.cse40 (mod v_~x$w_buff0_used~0_634 256)) (.cse41 (mod |v_P2Thread1of1ForFork1_#t~nondet14_38| 256))) (let ((.cse33 (= .cse41 0)) (.cse37 (= .cse40 0)) (.cse35 (= 0 (mod v_~x$w_buff1_used~0_581 256))) (.cse12 (= (mod v_~x$r_buff0_thd3~0_235 256) 0)) (.cse22 (= (mod |v_P2Thread1of1ForFork1_#t~nondet15_38| 256) 0))) (let ((.cse0 (not .cse22)) (.cse31 (not .cse12)) (.cse32 (not .cse35)) (.cse4 (= (mod v_~x$r_buff1_thd3~0_227 256) 0)) (.cse36 (not .cse37)) (.cse6 (not .cse33)) (.cse34 (= (mod v_~weak$$choice1~0_202 256) 0))) (let ((.cse14 (ite (= (ite .cse0 .cse40 (ite .cse37 .cse40 (ite (and .cse31 .cse36) 0 (ite (and .cse32 .cse12 .cse4 .cse36) (ite (or .cse6 .cse34) 1 0) .cse41)))) 0) 0 1))) (let ((.cse1 (= (mod .cse14 256) 0))) (let ((.cse2 (not .cse1))) (let ((.cse11 (and .cse2 .cse31))) (let ((.cse15 (ite .cse0 v_~x$w_buff1_used~0_581 (ite .cse1 v_~x$w_buff1_used~0_581 (ite .cse11 0 (ite (and .cse32 .cse2 .cse12 .cse4) |v_P2Thread1of1ForFork1_#t~nondet14_38| 0)))))) (let ((.cse9 (= (mod v_~x$r_buff1_thd1~0_266 256) 0)) (.cse39 (= (mod .cse15 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd1~0_266 256) 0))) (let ((.cse38 (= (mod v_~weak$$choice2~0_189 256) 0)) (.cse19 (select |v_#memory_int_686| |v_~#x~0.base_335|)) (.cse8 (not .cse20)) (.cse17 (and .cse20 .cse39)) (.cse18 (and .cse20 .cse9))) (let ((.cse5 (not .cse39)) (.cse10 (or .cse17 .cse1 .cse18)) (.cse7 (and .cse2 .cse8)) (.cse16 (= (mod v_~x$w_buff0_used~0_632 256) 0)) (.cse21 (= (mod v_~x$w_buff1_used~0_579 256) 0)) (.cse23 (select .cse19 |v_~#x~0.offset_335|)) (.cse13 (not .cse38))) (and (= v_~weak$$choice1~0_202 |v_P2Thread1of1ForFork1_#t~nondet17_38|) (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= (ite .cse0 v_~x$r_buff1_thd3~0_227 (ite .cse1 v_~x$r_buff1_thd3~0_227 (let ((.cse3 (= (mod v_~x$r_buff0_thd3~0_234 256) 0))) (ite (and .cse2 (not .cse3)) 0 (ite (and .cse2 .cse4 .cse5 .cse3) (ite .cse6 v_~x$r_buff1_thd3~0_227 0) 0))))) v_~x$r_buff1_thd3~0_226) (= |v_~#x~0.offset_335| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_148) (= v_~__unbuffered_p2_EAX$read_delayed~0_145 1) (= v_~weak$$choice2~0_189 |v_P0Thread1of1ForFork2_#t~nondet4_176|) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_148 |v_~#x~0.base_335|) (or (and (= v_~__unbuffered_p0_EAX~0_190 (ite .cse7 v_~x$w_buff0~0_440 v_~x$w_buff1~0_393)) .cse2 (or .cse8 .cse5) (= |v_P0Thread1of1ForFork2_#t~mem6_176| |v_P0_#t~mem6_133|) (or (not .cse9) .cse8)) (and (= v_~__unbuffered_p0_EAX~0_190 |v_P0_#t~mem6_133|) .cse10 (= |v_P0_#t~mem6_133| v_~x$mem_tmp~0_149))) (= v_P0Thread1of1ForFork2_~arg.base_29 |v_P0Thread1of1ForFork2_#in~arg.base_29|) (= (ite .cse0 v_~x$r_buff0_thd3~0_235 (ite .cse1 v_~x$r_buff0_thd3~0_235 (ite .cse11 0 (ite (and .cse2 .cse12 .cse4 .cse5) v_~x$r_buff0_thd3~0_235 0)))) v_~x$r_buff0_thd3~0_234) (= v_~x$w_buff0_used~0_632 (ite .cse13 .cse14 (ite .cse10 .cse14 (ite .cse7 0 .cse14)))) (= v_~x$w_buff1~0_393 v_~x$w_buff1~0_391) (= v_~x$w_buff1_used~0_579 (ite .cse13 .cse15 (ite (or .cse16 .cse17 .cse18) .cse15 0))) (= v_~weak$$choice0~0_197 |v_P0Thread1of1ForFork2_#t~nondet3_176|) (= (store |v_#memory_int_686| |v_~#x~0.base_335| (store .cse19 |v_~#x~0.offset_335| |v_P0_#t~ite10_132|)) |v_#memory_int_684|) (= (ite .cse13 v_~x$r_buff0_thd1~0_266 (ite (or .cse16 (and .cse20 .cse21) .cse18) v_~x$r_buff0_thd1~0_266 (ite (and .cse8 (not .cse16)) 0 v_~x$r_buff0_thd1~0_266))) v_~x$r_buff0_thd1~0_265) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_29| v_P0Thread1of1ForFork2_~arg.offset_29) (= v_~y~0_152 2) (or (and (= |v_P2_#t~mem28_55| v_~__unbuffered_p2_EAX~0_273) .cse22 (= |v_P2_#t~mem28_55| v_~x$mem_tmp~0_149)) (and (= |v_P2Thread1of1ForFork1_#t~mem28_38| |v_P2_#t~mem28_55|) (= .cse23 v_~x$mem_tmp~0_149) .cse0)) (= v_~x$flush_delayed~0_175 0) (= v_~x$r_buff1_thd1~0_265 (ite .cse13 v_~x$r_buff1_thd1~0_266 (ite (let ((.cse24 (= (mod v_~x$r_buff0_thd1~0_265 256) 0))) (or .cse16 (and .cse21 .cse24) (and .cse9 .cse24))) v_~x$r_buff1_thd1~0_266 0))) (let ((.cse25 (= |v_P2Thread1of1ForFork1_#t~mem19_38| |v_P2_#t~mem19_85|)) (.cse26 (= |v_P2_#t~ite22_88| |v_P2Thread1of1ForFork1_#t~ite22_38|)) (.cse27 (= |v_P2_#t~ite20_82| |v_P2Thread1of1ForFork1_#t~ite20_38|)) (.cse28 (= |v_P2Thread1of1ForFork1_#t~mem21_38| |v_P2_#t~mem21_91|)) (.cse29 (= |v_P2_#t~ite24_74| |v_P2Thread1of1ForFork1_#t~ite24_38|)) (.cse30 (= |v_P2_#t~ite23_82| |v_P2Thread1of1ForFork1_#t~ite23_38|))) (or (and (or (and .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |v_P2_#t~ite25_64| v_~x$w_buff0~0_440)) (and (or (and .cse32 .cse26 .cse28 (or (and (= .cse23 |v_P2_#t~mem19_85|) .cse6 (= |v_P2_#t~ite20_82| |v_P2_#t~mem19_85|)) (and .cse25 .cse33 (= |v_P2_#t~ite20_82| (ite (not .cse34) v_~x$w_buff0~0_440 v_~x$w_buff1~0_393)))) .cse30 (= |v_P2_#t~ite20_82| |v_P2_#t~ite24_74|) .cse4) (and .cse25 (or (and .cse32 .cse26 .cse28 (= |v_P2_#t~ite23_82| (ite .cse6 v_~x$w_buff1~0_393 v_~x$w_buff0~0_440))) (and (= |v_P2_#t~ite22_88| |v_P2_#t~ite23_82|) .cse35 (or (and (= .cse23 |v_P2_#t~mem21_91|) .cse33 (= |v_P2_#t~ite22_88| |v_P2_#t~mem21_91|)) (and (= |v_P2_#t~ite22_88| v_~x$w_buff0~0_440) .cse28 .cse6)))) .cse27 (or (not .cse4) .cse35) (= |v_P2_#t~ite24_74| |v_P2_#t~ite23_82|))) (= |v_P2_#t~ite24_74| |v_P2_#t~ite25_64|) .cse12)) (= |v_P2_#t~ite25_64| v_~__unbuffered_p2_EAX~0_273) .cse36 (= |v_P2Thread1of1ForFork1_#t~mem18_38| |v_P2_#t~mem18_57|)) (and .cse25 (= |v_P2_#t~ite25_64| |v_P2Thread1of1ForFork1_#t~ite25_38|) .cse26 .cse27 .cse28 .cse37 .cse29 .cse30 (= |v_P2_#t~mem18_57| v_~__unbuffered_p2_EAX~0_273) (= .cse23 |v_P2_#t~mem18_57|)))) (or (and .cse13 (= |v_P0_#t~ite10_132| v_~x$mem_tmp~0_149) (= |v_P0Thread1of1ForFork2_#t~mem9_176| |v_P0_#t~mem9_131|)) (and (= v_~__unbuffered_p0_EAX~0_190 |v_P0_#t~mem9_131|) .cse38 (= |v_P0_#t~ite10_132| |v_P0_#t~mem9_131|))) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_440))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_440, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_38|, P2Thread1of1ForFork1_#t~mem18=|v_P2Thread1of1ForFork1_#t~mem18_38|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_266, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_227, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_266, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_176|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_235, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_176|, P2Thread1of1ForFork1_#t~ite24=|v_P2Thread1of1ForFork1_#t~ite24_38|, P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_38|, P2Thread1of1ForFork1_#t~ite22=|v_P2Thread1of1ForFork1_#t~ite22_38|, P2Thread1of1ForFork1_#t~ite23=|v_P2Thread1of1ForFork1_#t~ite23_38|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~#x~0.offset=|v_~#x~0.offset_335|, P2Thread1of1ForFork1_#t~mem28=|v_P2Thread1of1ForFork1_#t~mem28_38|, ~x$w_buff1~0=v_~x$w_buff1~0_393, P2Thread1of1ForFork1_#t~nondet14=|v_P2Thread1of1ForFork1_#t~nondet14_38|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_581, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, P2Thread1of1ForFork1_#t~nondet17=|v_P2Thread1of1ForFork1_#t~nondet17_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_634, P2Thread1of1ForFork1_#t~nondet15=|v_P2Thread1of1ForFork1_#t~nondet15_38|, #memory_int=|v_#memory_int_686|, ~#x~0.base=|v_~#x~0.base_335|, P2Thread1of1ForFork1_#t~mem21=|v_P2Thread1of1ForFork1_#t~mem21_38|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_176|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_176|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_438, ~x$flush_delayed~0=v_~x$flush_delayed~0_175, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_148, P2Thread1of1ForFork1_#t~mem16=|v_P2Thread1of1ForFork1_#t~mem16_21|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_148, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_265, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_90|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_234, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_29, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_190, ~weak$$choice1~0=v_~weak$$choice1~0_202, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_21|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_273, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_90|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~#x~0.offset=|v_~#x~0.offset_335|, ~x$w_buff1~0=v_~x$w_buff1~0_391, P2Thread1of1ForFork1_#t~mem27=|v_P2Thread1of1ForFork1_#t~mem27_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_579, ~weak$$choice0~0=v_~weak$$choice0~0_197, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_265, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_226, ~x$mem_tmp~0=v_~x$mem_tmp~0_149, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_90|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, ~y~0=v_~y~0_152, P2Thread1of1ForFork1_#t~ite29=|v_P2Thread1of1ForFork1_#t~ite29_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_632, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_145, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_90|, #memory_int=|v_#memory_int_684|, ~#x~0.base=|v_~#x~0.base_335|, ~weak$$choice2~0=v_~weak$$choice2~0_189} AuxVars[|v_P2_#t~ite24_74|, |v_P2_#t~ite25_64|, |v_P2_#t~ite20_82|, |v_P0_#t~mem9_131|, |v_P2_#t~mem21_91|, |v_P2_#t~mem28_55|, |v_P2_#t~ite22_88|, |v_P2_#t~mem18_57|, |v_P0_#t~ite10_132|, |v_P0_#t~mem6_133|, |v_P2_#t~mem19_85|, |v_P2_#t~ite23_82|] AssignedVars[~x$w_buff0~0, P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~mem18, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork1_#t~mem16, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork2_#t~mem5, P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_~arg.base, P2Thread1of1ForFork1_#t~ite22, P2Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P2Thread1of1ForFork1_#t~ite29, P0Thread1of1ForFork2_#t~ite10, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem28, ~x$w_buff1~0, P2Thread1of1ForFork1_#t~mem27, P2Thread1of1ForFork1_#t~nondet14, ~x$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet17, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork1_#t~nondet15, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, P2Thread1of1ForFork1_#t~mem21, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] and [701] L835-->L842: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd3~0_78 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_217 256) 0))) (.cse6 (not .cse7)) (.cse8 (= (mod v_~x$w_buff0_used~0_218 256) 0)) (.cse10 (= 0 (mod v_~x$r_buff1_thd3~0_74 256))) (.cse9 (= (mod v_~x$w_buff1_used~0_204 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (select |v_#memory_int_219| |v_~#x~0.base_148|)) (.cse1 (not .cse10)) (.cse4 (not .cse8)) (.cse0 (and .cse11 .cse6))) (and (= v_~x$w_buff1_used~0_203 (ite (or .cse0 (and .cse1 .cse2)) 0 v_~x$w_buff1_used~0_204)) (= |v_#memory_int_218| (store |v_#memory_int_219| |v_~#x~0.base_148| (store .cse3 |v_~#x~0.offset_148| |v_P2_#t~ite32_27|))) (let ((.cse5 (= |v_P2_#t~mem30_30| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (= |v_P2_#t~ite32_27| v_~x$w_buff0~0_98) .cse4 .cse5 (= |v_P2_#t~ite31_27| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse6) (and (= |v_P2_#t~ite31_27| |v_P2_#t~ite32_27|) (or .cse7 .cse8) (or (and .cse5 (= |v_P2_#t~ite31_27| v_~x$w_buff1~0_101) .cse1 .cse2) (and (= |v_P2_#t~ite31_27| |v_P2_#t~mem30_30|) (= (select .cse3 |v_~#x~0.offset_148|) |v_P2_#t~mem30_30|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd3~0_73 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_77 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 0 v_~x$r_buff1_thd3~0_74)) (= (ite (and .cse4 .cse6) 0 v_~x$w_buff0_used~0_218) v_~x$w_buff0_used~0_217) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_78) v_~x$r_buff0_thd3~0_77))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_98, ~#x~0.offset=|v_~#x~0.offset_148|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_219|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_204, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_98, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_148|, ~x$w_buff1~0=v_~x$w_buff1~0_101, #memory_int=|v_#memory_int_218|, ~#x~0.base=|v_~#x~0.base_148|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_73, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} AuxVars[|v_P2_#t~ite31_27|, |v_P2_#t~mem30_30|, |v_P2_#t~ite32_27|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-13 00:53:12,032 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:53:12,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25282 [2022-12-13 00:53:12,032 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 403 flow [2022-12-13 00:53:12,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 00:53:12,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:12,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:12,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:53:12,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 219417991, now seen corresponding path program 1 times [2022-12-13 00:53:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:12,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055475720] [2022-12-13 00:53:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:53:12,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:53:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:53:12,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:53:12,136 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:53:12,136 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:53:12,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:53:12,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:53:12,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:53:12,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:53:12,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:53:12,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:53:12,141 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:12,147 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:53:12,147 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:53:12,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:53:12 BasicIcfg [2022-12-13 00:53:12,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:53:12,220 INFO L158 Benchmark]: Toolchain (without parser) took 55706.31ms. Allocated memory was 198.2MB in the beginning and 999.3MB in the end (delta: 801.1MB). Free memory was 173.4MB in the beginning and 325.6MB in the end (delta: -152.2MB). Peak memory consumption was 649.7MB. Max. memory is 8.0GB. [2022-12-13 00:53:12,220 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:53:12,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.56ms. Allocated memory is still 198.2MB. Free memory was 173.4MB in the beginning and 144.8MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 00:53:12,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.32ms. Allocated memory is still 198.2MB. Free memory was 144.8MB in the beginning and 142.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:12,221 INFO L158 Benchmark]: Boogie Preprocessor took 53.43ms. Allocated memory is still 198.2MB. Free memory was 142.2MB in the beginning and 139.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:12,221 INFO L158 Benchmark]: RCFGBuilder took 856.87ms. Allocated memory was 198.2MB in the beginning and 262.1MB in the end (delta: 64.0MB). Free memory was 139.6MB in the beginning and 228.8MB in the end (delta: -89.2MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. [2022-12-13 00:53:12,221 INFO L158 Benchmark]: TraceAbstraction took 54290.41ms. Allocated memory was 262.1MB in the beginning and 999.3MB in the end (delta: 737.1MB). Free memory was 227.7MB in the beginning and 325.6MB in the end (delta: -97.9MB). Peak memory consumption was 639.8MB. Max. memory is 8.0GB. [2022-12-13 00:53:12,222 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.56ms. Allocated memory is still 198.2MB. Free memory was 173.4MB in the beginning and 144.8MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.32ms. Allocated memory is still 198.2MB. Free memory was 144.8MB in the beginning and 142.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.43ms. Allocated memory is still 198.2MB. Free memory was 142.2MB in the beginning and 139.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 856.87ms. Allocated memory was 198.2MB in the beginning and 262.1MB in the end (delta: 64.0MB). Free memory was 139.6MB in the beginning and 228.8MB in the end (delta: -89.2MB). Peak memory consumption was 81.2MB. Max. memory is 8.0GB. * TraceAbstraction took 54290.41ms. Allocated memory was 262.1MB in the beginning and 999.3MB in the end (delta: 737.1MB). Free memory was 227.7MB in the beginning and 325.6MB in the end (delta: -97.9MB). Peak memory consumption was 639.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.6s, 129 PlacesBefore, 68 PlacesAfterwards, 121 TransitionsBefore, 58 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2898, independent: 2732, independent conditional: 2732, independent unconditional: 0, dependent: 166, dependent conditional: 166, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2898, independent: 2732, independent conditional: 0, independent unconditional: 2732, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2898, independent: 2732, independent conditional: 0, independent unconditional: 2732, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2898, independent: 2732, independent conditional: 0, independent unconditional: 2732, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1640, independent: 1592, independent conditional: 0, independent unconditional: 1592, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1640, independent: 1558, independent conditional: 0, independent unconditional: 1558, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 488, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 455, dependent conditional: 0, dependent unconditional: 455, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2898, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1640, unknown conditional: 0, unknown unconditional: 1640] , Statistics on independence cache: Total cache size (in pairs): 3444, Positive cache size: 3396, Positive conditional cache size: 0, Positive unconditional cache size: 3396, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 146, independent conditional: 10, independent unconditional: 136, dependent: 30, dependent conditional: 1, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 156, independent: 134, independent conditional: 10, independent unconditional: 124, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 156, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 146, dependent conditional: 16, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 156, unknown conditional: 11, unknown unconditional: 145] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 134, Positive conditional cache size: 10, Positive unconditional cache size: 124, Negative cache size: 22, Negative conditional cache size: 1, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 139, independent conditional: 139, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 166, independent: 139, independent conditional: 13, independent unconditional: 126, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 143, Positive conditional cache size: 10, Positive unconditional cache size: 133, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 146, independent: 120, independent conditional: 19, independent unconditional: 101, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 143, Positive conditional cache size: 10, Positive unconditional cache size: 133, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 47 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 76, independent conditional: 58, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 76, independent conditional: 46, independent unconditional: 30, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 76, independent conditional: 46, independent unconditional: 30, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 69, independent conditional: 44, independent unconditional: 25, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 166, Positive conditional cache size: 12, Positive unconditional cache size: 154, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 166, Positive conditional cache size: 12, Positive unconditional cache size: 154, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 56 PlacesBefore, 56 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 39, independent unconditional: 27, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 66, independent conditional: 33, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 33, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 7, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 54, independent conditional: 26, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 186, Positive conditional cache size: 19, Positive unconditional cache size: 167, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 64 PlacesBefore, 64 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 5, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 204, Positive conditional cache size: 24, Positive unconditional cache size: 180, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 61 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 74, independent conditional: 14, independent unconditional: 60, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 74, independent conditional: 14, independent unconditional: 60, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 73, independent conditional: 13, independent unconditional: 60, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 213, Positive conditional cache size: 25, Positive unconditional cache size: 188, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 61 PlacesBefore, 59 PlacesAfterwards, 65 TransitionsBefore, 63 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 16, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 26, independent conditional: 10, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 216, Positive conditional cache size: 27, Positive unconditional cache size: 189, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.3s, 58 PlacesBefore, 56 PlacesAfterwards, 60 TransitionsBefore, 58 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 188, independent conditional: 188, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 194, independent: 188, independent conditional: 182, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, independent: 188, independent conditional: 97, independent unconditional: 91, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 194, independent: 188, independent conditional: 97, independent unconditional: 91, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 14, independent unconditional: 9, 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: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 194, independent: 165, independent conditional: 83, independent unconditional: 82, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 23, unknown conditional: 14, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 280, Positive conditional cache size: 41, Positive unconditional cache size: 239, Negative cache size: 24, Negative conditional cache size: 1, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 85, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2257, ((void *)0), P0, ((void *)0))=-2, t2257={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2258, ((void *)0), P1, ((void *)0))=-1, t2257={7:0}, t2258={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2259, ((void *)0), P2, ((void *)0))=0, t2257={7:0}, t2258={8:0}, t2259={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 \read(x) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 [L834] 3 y = 1 [L759] 3 y = 2 [L789] 3 x$w_buff1 = x$w_buff0 [L790] 3 x$w_buff0 = 1 [L791] 3 x$w_buff1_used = x$w_buff0_used [L792] 3 x$w_buff0_used = (_Bool)1 [L793] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L793] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 3 x$r_buff0_thd2 = (_Bool)1 [L764] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 3 x$flush_delayed = weak$$choice2 [L767] EXPR 3 \read(x) [L767] 3 x$mem_tmp = x [L768] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 3 \read(x) [L768] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 3 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 3 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 3 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 3 \read(x) [L775] 3 __unbuffered_p0_EAX = x [L776] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 3 \read(x) [L776] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L776] 3 x = x$flush_delayed ? x$mem_tmp : x [L777] 3 x$flush_delayed = (_Bool)0 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 3 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 3 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=50, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=50, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 54.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 245 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 2 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=607occurred in iteration=7, InterpolantAutomatonStates: 42, 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, 4.2s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 1545 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 00:53:12,272 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...