/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:48:31,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:48:31,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:48:31,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:48:31,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:48:31,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:48:31,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:48:31,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:48:31,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:48:31,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:48:31,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:48:31,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:48:31,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:48:31,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:48:31,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:48:31,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:48:31,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:48:31,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:48:31,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:48:31,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:48:31,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:48:31,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:48:31,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:48:31,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:48:31,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:48:31,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:48:31,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:48:31,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:48:31,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:48:31,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:48:31,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:48:31,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:48:31,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:48:31,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:48:31,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:48:31,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:48:31,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:48:31,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:48:31,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:48:31,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:48:31,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:48:31,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:48:31,163 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:48:31,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:48:31,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:48:31,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:48:31,166 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:48:31,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:48:31,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:48:31,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:48:31,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:48:31,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:48:31,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:48:31,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:48:31,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:31,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:48:31,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:48:31,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:48:31,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:48:31,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:48:31,445 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:48:31,447 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:48:31,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2022-12-13 11:48:32,500 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:48:32,757 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:48:32,758 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2022-12-13 11:48:32,773 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0b6df04/a58c89e6b89c4503b9d9c4a5e83f19a5/FLAGe6f3820c7 [2022-12-13 11:48:32,789 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0b6df04/a58c89e6b89c4503b9d9c4a5e83f19a5 [2022-12-13 11:48:32,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:48:32,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:48:32,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:32,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:48:32,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:48:32,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:32" (1/1) ... [2022-12-13 11:48:32,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2551623c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:32, skipping insertion in model container [2022-12-13 11:48:32,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:48:32" (1/1) ... [2022-12-13 11:48:32,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:48:32,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:48:32,970 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/mix022_tso.i[944,957] [2022-12-13 11:48:33,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:33,116 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:48:33,123 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/mix022_tso.i[944,957] [2022-12-13 11:48:33,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:48:33,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:48:33,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:48:33,192 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:48:33,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33 WrapperNode [2022-12-13 11:48:33,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:48:33,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:33,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:48:33,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:48:33,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,255 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 11:48:33,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:48:33,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:48:33,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:48:33,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:48:33,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,282 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:48:33,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:48:33,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:48:33,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:48:33,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (1/1) ... [2022-12-13 11:48:33,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:48:33,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:48:33,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:48:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:48:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:48:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:48:33,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:48:33,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:48:33,353 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:48:33,441 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:48:33,442 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:48:33,740 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:48:33,883 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:48:33,884 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:48:33,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:33 BoogieIcfgContainer [2022-12-13 11:48:33,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:48:33,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:48:33,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:48:33,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:48:33,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:48:32" (1/3) ... [2022-12-13 11:48:33,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263c0c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:33, skipping insertion in model container [2022-12-13 11:48:33,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:48:33" (2/3) ... [2022-12-13 11:48:33,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263c0c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:48:33, skipping insertion in model container [2022-12-13 11:48:33,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:48:33" (3/3) ... [2022-12-13 11:48:33,896 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2022-12-13 11:48:33,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:48:33,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:48:33,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:48:33,951 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:48:33,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-13 11:48:34,010 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-13 11:48:34,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:34,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 11:48:34,013 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-13 11:48:34,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-13 11:48:34,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:34,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-13 11:48:34,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-13 11:48:34,058 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-13 11:48:34,059 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:34,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 11:48:34,061 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-13 11:48:34,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-13 11:48:39,700 INFO L241 LiptonReduction]: Total number of compositions: 72 [2022-12-13 11:48:39,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:48:39,716 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;@1a34fea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:48:39,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 11:48:39,723 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-13 11:48:39,723 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:39,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:39,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:48:39,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:39,729 INFO L85 PathProgramCache]: Analyzing trace with hash 429348793, now seen corresponding path program 1 times [2022-12-13 11:48:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:39,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042303341] [2022-12-13 11:48:39,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:40,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042303341] [2022-12-13 11:48:40,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042303341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:40,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:40,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937231559] [2022-12-13 11:48:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:40,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:40,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2022-12-13 11:48:40,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:40,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:40,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2022-12-13 11:48:40,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:40,600 INFO L130 PetriNetUnfolder]: 1155/2135 cut-off events. [2022-12-13 11:48:40,605 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:48:40,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4037 conditions, 2135 events. 1155/2135 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 13888 event pairs, 100 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 4027. Up to 1656 conditions per place. [2022-12-13 11:48:40,618 INFO L137 encePairwiseOnDemand]: 41/46 looper letters, 21 selfloop transitions, 2 changer transitions 40/70 dead transitions. [2022-12-13 11:48:40,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 272 flow [2022-12-13 11:48:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-12-13 11:48:40,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.644927536231884 [2022-12-13 11:48:40,629 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 98 flow. Second operand 3 states and 89 transitions. [2022-12-13 11:48:40,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 272 flow [2022-12-13 11:48:40,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:40,634 INFO L231 Difference]: Finished difference. Result has 50 places, 23 transitions, 54 flow [2022-12-13 11:48:40,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=50, PETRI_TRANSITIONS=23} [2022-12-13 11:48:40,638 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 11:48:40,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:40,639 INFO L89 Accepts]: Start accepts. Operand has 50 places, 23 transitions, 54 flow [2022-12-13 11:48:40,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:40,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:40,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 23 transitions, 54 flow [2022-12-13 11:48:40,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 54 flow [2022-12-13 11:48:40,645 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-13 11:48:40,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 43 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:48:40,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 54 flow [2022-12-13 11:48:40,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-13 11:48:40,752 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:40,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 11:48:40,754 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 54 flow [2022-12-13 11:48:40,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:40,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:40,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:40,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:48:40,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash 287313326, now seen corresponding path program 1 times [2022-12-13 11:48:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567146301] [2022-12-13 11:48:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567146301] [2022-12-13 11:48:41,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567146301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:41,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:41,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:48:41,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914318431] [2022-12-13 11:48:41,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:41,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:41,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:41,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2022-12-13 11:48:41,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:41,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:41,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2022-12-13 11:48:41,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:41,312 INFO L130 PetriNetUnfolder]: 211/412 cut-off events. [2022-12-13 11:48:41,312 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 11:48:41,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 412 events. 211/412 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1743 event pairs, 95 based on Foata normal form. 2/364 useless extension candidates. Maximal degree in co-relation 808. Up to 352 conditions per place. [2022-12-13 11:48:41,314 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 21 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2022-12-13 11:48:41,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 120 flow [2022-12-13 11:48:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 11:48:41,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-13 11:48:41,317 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 54 flow. Second operand 3 states and 43 transitions. [2022-12-13 11:48:41,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 120 flow [2022-12-13 11:48:41,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:41,318 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 69 flow [2022-12-13 11:48:41,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-12-13 11:48:41,318 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -21 predicate places. [2022-12-13 11:48:41,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:41,319 INFO L89 Accepts]: Start accepts. Operand has 31 places, 25 transitions, 69 flow [2022-12-13 11:48:41,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:41,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:41,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 25 transitions, 69 flow [2022-12-13 11:48:41,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 69 flow [2022-12-13 11:48:41,323 INFO L130 PetriNetUnfolder]: 3/41 cut-off events. [2022-12-13 11:48:41,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:48:41,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 104 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-13 11:48:41,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 25 transitions, 69 flow [2022-12-13 11:48:41,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 11:48:41,341 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:41,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 11:48:41,343 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 69 flow [2022-12-13 11:48:41,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:41,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:41,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:41,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:48:41,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 316778830, now seen corresponding path program 1 times [2022-12-13 11:48:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:41,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519931436] [2022-12-13 11:48:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:41,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519931436] [2022-12-13 11:48:41,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519931436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:41,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:41,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:48:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314333626] [2022-12-13 11:48:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:48:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:48:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:48:41,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 23 [2022-12-13 11:48:41,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:41,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:41,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 23 [2022-12-13 11:48:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:41,610 INFO L130 PetriNetUnfolder]: 174/359 cut-off events. [2022-12-13 11:48:41,611 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 11:48:41,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 359 events. 174/359 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1543 event pairs, 58 based on Foata normal form. 10/320 useless extension candidates. Maximal degree in co-relation 729. Up to 227 conditions per place. [2022-12-13 11:48:41,613 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 21 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-13 11:48:41,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 127 flow [2022-12-13 11:48:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:48:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:48:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 11:48:41,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-13 11:48:41,616 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 69 flow. Second operand 3 states and 44 transitions. [2022-12-13 11:48:41,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 127 flow [2022-12-13 11:48:41,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:48:41,621 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 74 flow [2022-12-13 11:48:41,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 11:48:41,623 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -19 predicate places. [2022-12-13 11:48:41,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:41,623 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 74 flow [2022-12-13 11:48:41,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:41,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:41,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 74 flow [2022-12-13 11:48:41,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 74 flow [2022-12-13 11:48:41,631 INFO L130 PetriNetUnfolder]: 2/33 cut-off events. [2022-12-13 11:48:41,631 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:48:41,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 33 events. 2/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 82 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 46. Up to 8 conditions per place. [2022-12-13 11:48:41,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 74 flow [2022-12-13 11:48:41,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 11:48:41,668 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:48:41,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 11:48:41,670 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 74 flow [2022-12-13 11:48:41,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:41,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:41,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:41,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:48:41,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:41,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1230667975, now seen corresponding path program 1 times [2022-12-13 11:48:41,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:41,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989312713] [2022-12-13 11:48:41,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:41,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:41,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989312713] [2022-12-13 11:48:41,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989312713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:41,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:41,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909274418] [2022-12-13 11:48:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:41,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:41,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:41,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 11:48:41,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:41,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:41,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 11:48:41,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:41,929 INFO L130 PetriNetUnfolder]: 182/400 cut-off events. [2022-12-13 11:48:41,930 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-13 11:48:41,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 400 events. 182/400 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1964 event pairs, 30 based on Foata normal form. 48/347 useless extension candidates. Maximal degree in co-relation 907. Up to 187 conditions per place. [2022-12-13 11:48:41,931 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 36 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2022-12-13 11:48:41,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 224 flow [2022-12-13 11:48:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-13 11:48:41,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7065217391304348 [2022-12-13 11:48:41,932 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 74 flow. Second operand 4 states and 65 transitions. [2022-12-13 11:48:41,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 224 flow [2022-12-13 11:48:41,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:48:41,934 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 132 flow [2022-12-13 11:48:41,934 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-13 11:48:41,935 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2022-12-13 11:48:41,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:41,935 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 132 flow [2022-12-13 11:48:41,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:41,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:41,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 132 flow [2022-12-13 11:48:41,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 132 flow [2022-12-13 11:48:41,946 INFO L130 PetriNetUnfolder]: 40/140 cut-off events. [2022-12-13 11:48:41,946 INFO L131 PetriNetUnfolder]: For 33/42 co-relation queries the response was YES. [2022-12-13 11:48:41,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 140 events. 40/140 cut-off events. For 33/42 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 719 event pairs, 9 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 330. Up to 91 conditions per place. [2022-12-13 11:48:41,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 132 flow [2022-12-13 11:48:41,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 11:48:42,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:48:42,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-13 11:48:42,210 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 134 flow [2022-12-13 11:48:42,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:42,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:42,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:42,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:48:42,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -263829234, now seen corresponding path program 1 times [2022-12-13 11:48:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:42,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423474085] [2022-12-13 11:48:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:42,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423474085] [2022-12-13 11:48:42,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423474085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:42,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:42,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:48:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927336318] [2022-12-13 11:48:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:42,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:48:42,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:48:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:48:42,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 11:48:42,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 11:48:42,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:42,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 11:48:42,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:42,455 INFO L130 PetriNetUnfolder]: 65/198 cut-off events. [2022-12-13 11:48:42,455 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 11:48:42,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 198 events. 65/198 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 880 event pairs, 10 based on Foata normal form. 33/184 useless extension candidates. Maximal degree in co-relation 611. Up to 90 conditions per place. [2022-12-13 11:48:42,456 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 19 selfloop transitions, 14 changer transitions 1/39 dead transitions. [2022-12-13 11:48:42,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 218 flow [2022-12-13 11:48:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:48:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:48:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-13 11:48:42,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-13 11:48:42,458 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 134 flow. Second operand 5 states and 59 transitions. [2022-12-13 11:48:42,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 218 flow [2022-12-13 11:48:42,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 198 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:42,460 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 165 flow [2022-12-13 11:48:42,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 11:48:42,461 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -13 predicate places. [2022-12-13 11:48:42,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:42,461 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 165 flow [2022-12-13 11:48:42,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:42,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:42,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 165 flow [2022-12-13 11:48:42,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 165 flow [2022-12-13 11:48:42,472 INFO L130 PetriNetUnfolder]: 19/99 cut-off events. [2022-12-13 11:48:42,472 INFO L131 PetriNetUnfolder]: For 63/75 co-relation queries the response was YES. [2022-12-13 11:48:42,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 99 events. 19/99 cut-off events. For 63/75 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 451 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 292. Up to 55 conditions per place. [2022-12-13 11:48:42,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 165 flow [2022-12-13 11:48:42,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 11:48:46,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] L793-->L796: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [437] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd0~0_361 256) 0)))) (let ((.cse10 (and .cse23 (not (= (mod v_~x$w_buff0_used~0_606 256) 0))))) (let ((.cse2 (ite .cse10 0 v_~x$w_buff0_used~0_606))) (let ((.cse18 (= (mod .cse2 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse12 (ite .cse22 0 v_~x$r_buff0_thd0~0_361)) (.cse20 (not (= 0 (mod v_~x$r_buff1_thd0~0_366 256))))) (let ((.cse11 (and .cse20 (not (= (mod v_~x$w_buff1_used~0_559 256) 0)))) (.cse13 (= (mod .cse12 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (ite (or .cse22 .cse11) 0 v_~x$w_buff1_used~0_559))) (let ((.cse19 (= (mod .cse16 256) 0)) (.cse4 (and .cse21 .cse15))) (let ((.cse5 (ite (or (and .cse20 (not .cse19)) .cse4) 0 v_~x$r_buff1_thd0~0_366))) (let ((.cse9 (= (mod .cse5 256) 0))) (let ((.cse17 (and .cse13 .cse19)) (.cse14 (and .cse9 .cse13))) (let ((.cse3 (or .cse17 .cse18 .cse14))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_140 (ite .cse4 v_~x$w_buff0~0_401 v_~x$w_buff1~0_375))) (.cse6 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (= (mod v_~x$w_buff0_used~0_605 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_171| v_~weak$$choice2~0_166) (= v_~main$tmp_guard0~0_137 (ite (= (ite (= v_~__unbuffered_cnt~0_255 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_main_#t~nondet9#1_167| v_~weak$$choice0~0_118) (= v_~x$w_buff1~0_375 v_~x$w_buff1~0_374) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|) (= v_~main$tmp_guard1~0_98 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_109 0) (= v_~__unbuffered_p1_EAX~0_122 2) (= 2 .cse0))) 1 0) 0) 0 1)) (= v_~x$flush_delayed~0_160 0) (= v_~x$w_buff0_used~0_605 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| (mod v_~main$tmp_guard0~0_137 256)) (= v_~x$w_buff0~0_401 v_~x$w_buff0~0_400) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= (ite .cse1 v_~x$mem_tmp~0_140 .cse0) v_~x~0_530) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~x$r_buff1_thd0~0_365 (ite .cse1 .cse5 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_360 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse9 .cse7))) .cse5 0))) (= (ite .cse10 v_~x$w_buff0~0_401 (ite .cse11 v_~x$w_buff1~0_375 v_~x~0_531)) v_~x$mem_tmp~0_140) (= v_~x$r_buff0_thd0~0_360 (ite .cse1 .cse12 (ite (or (and .cse13 .cse6) .cse8 .cse14) .cse12 (ite (and (not .cse8) .cse15) 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124| 0)) (= (ite .cse1 .cse16 (ite (or .cse17 .cse8 .cse14) .cse16 0)) v_~x$w_buff1_used~0_558))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_171|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_167|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ~x~0=v_~x~0_531} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_360, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ~x$flush_delayed~0=v_~x$flush_delayed~0_160, ~x$w_buff1~0=v_~x$w_buff1~0_374, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_137, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_605, ~weak$$choice0~0=v_~weak$$choice0~0_118, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~x~0=v_~x~0_530, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:47,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] L793-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_5| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_5| 0) (= v_~__unbuffered_cnt~0_23 (+ v_~__unbuffered_cnt~0_24 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] and [437] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd0~0_361 256) 0)))) (let ((.cse10 (and .cse23 (not (= (mod v_~x$w_buff0_used~0_606 256) 0))))) (let ((.cse2 (ite .cse10 0 v_~x$w_buff0_used~0_606))) (let ((.cse18 (= (mod .cse2 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse12 (ite .cse22 0 v_~x$r_buff0_thd0~0_361)) (.cse20 (not (= 0 (mod v_~x$r_buff1_thd0~0_366 256))))) (let ((.cse11 (and .cse20 (not (= (mod v_~x$w_buff1_used~0_559 256) 0)))) (.cse13 (= (mod .cse12 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (ite (or .cse22 .cse11) 0 v_~x$w_buff1_used~0_559))) (let ((.cse19 (= (mod .cse16 256) 0)) (.cse4 (and .cse21 .cse15))) (let ((.cse5 (ite (or (and .cse20 (not .cse19)) .cse4) 0 v_~x$r_buff1_thd0~0_366))) (let ((.cse9 (= (mod .cse5 256) 0))) (let ((.cse17 (and .cse13 .cse19)) (.cse14 (and .cse9 .cse13))) (let ((.cse3 (or .cse17 .cse18 .cse14))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_140 (ite .cse4 v_~x$w_buff0~0_401 v_~x$w_buff1~0_375))) (.cse6 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (= (mod v_~x$w_buff0_used~0_605 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_171| v_~weak$$choice2~0_166) (= v_~main$tmp_guard0~0_137 (ite (= (ite (= v_~__unbuffered_cnt~0_255 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_main_#t~nondet9#1_167| v_~weak$$choice0~0_118) (= v_~x$w_buff1~0_375 v_~x$w_buff1~0_374) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|) (= v_~main$tmp_guard1~0_98 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_109 0) (= v_~__unbuffered_p1_EAX~0_122 2) (= 2 .cse0))) 1 0) 0) 0 1)) (= v_~x$flush_delayed~0_160 0) (= v_~x$w_buff0_used~0_605 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| (mod v_~main$tmp_guard0~0_137 256)) (= v_~x$w_buff0~0_401 v_~x$w_buff0~0_400) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= (ite .cse1 v_~x$mem_tmp~0_140 .cse0) v_~x~0_530) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~x$r_buff1_thd0~0_365 (ite .cse1 .cse5 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_360 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse9 .cse7))) .cse5 0))) (= (ite .cse10 v_~x$w_buff0~0_401 (ite .cse11 v_~x$w_buff1~0_375 v_~x~0_531)) v_~x$mem_tmp~0_140) (= v_~x$r_buff0_thd0~0_360 (ite .cse1 .cse12 (ite (or (and .cse13 .cse6) .cse8 .cse14) .cse12 (ite (and (not .cse8) .cse15) 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124| 0)) (= (ite .cse1 .cse16 (ite (or .cse17 .cse8 .cse14) .cse16 0)) v_~x$w_buff1_used~0_558))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_171|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_167|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ~x~0=v_~x~0_531} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_360, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ~x$flush_delayed~0=v_~x$flush_delayed~0_160, ~x$w_buff1~0=v_~x$w_buff1~0_374, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_137, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_605, ~weak$$choice0~0=v_~weak$$choice0~0_118, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~x~0=v_~x~0_530, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:47,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L793-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P1Thread1of1ForFork1_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] and [437] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd0~0_361 256) 0)))) (let ((.cse10 (and .cse23 (not (= (mod v_~x$w_buff0_used~0_606 256) 0))))) (let ((.cse2 (ite .cse10 0 v_~x$w_buff0_used~0_606))) (let ((.cse18 (= (mod .cse2 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse12 (ite .cse22 0 v_~x$r_buff0_thd0~0_361)) (.cse20 (not (= 0 (mod v_~x$r_buff1_thd0~0_366 256))))) (let ((.cse11 (and .cse20 (not (= (mod v_~x$w_buff1_used~0_559 256) 0)))) (.cse13 (= (mod .cse12 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (ite (or .cse22 .cse11) 0 v_~x$w_buff1_used~0_559))) (let ((.cse19 (= (mod .cse16 256) 0)) (.cse4 (and .cse21 .cse15))) (let ((.cse5 (ite (or (and .cse20 (not .cse19)) .cse4) 0 v_~x$r_buff1_thd0~0_366))) (let ((.cse9 (= (mod .cse5 256) 0))) (let ((.cse17 (and .cse13 .cse19)) (.cse14 (and .cse9 .cse13))) (let ((.cse3 (or .cse17 .cse18 .cse14))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_140 (ite .cse4 v_~x$w_buff0~0_401 v_~x$w_buff1~0_375))) (.cse6 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (= (mod v_~x$w_buff0_used~0_605 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_171| v_~weak$$choice2~0_166) (= v_~main$tmp_guard0~0_137 (ite (= (ite (= v_~__unbuffered_cnt~0_255 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_main_#t~nondet9#1_167| v_~weak$$choice0~0_118) (= v_~x$w_buff1~0_375 v_~x$w_buff1~0_374) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|) (= v_~main$tmp_guard1~0_98 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_109 0) (= v_~__unbuffered_p1_EAX~0_122 2) (= 2 .cse0))) 1 0) 0) 0 1)) (= v_~x$flush_delayed~0_160 0) (= v_~x$w_buff0_used~0_605 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| (mod v_~main$tmp_guard0~0_137 256)) (= v_~x$w_buff0~0_401 v_~x$w_buff0~0_400) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= (ite .cse1 v_~x$mem_tmp~0_140 .cse0) v_~x~0_530) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~x$r_buff1_thd0~0_365 (ite .cse1 .cse5 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_360 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse9 .cse7))) .cse5 0))) (= (ite .cse10 v_~x$w_buff0~0_401 (ite .cse11 v_~x$w_buff1~0_375 v_~x~0_531)) v_~x$mem_tmp~0_140) (= v_~x$r_buff0_thd0~0_360 (ite .cse1 .cse12 (ite (or (and .cse13 .cse6) .cse8 .cse14) .cse12 (ite (and (not .cse8) .cse15) 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124| 0)) (= (ite .cse1 .cse16 (ite (or .cse17 .cse8 .cse14) .cse16 0)) v_~x$w_buff1_used~0_558))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_171|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_167|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ~x~0=v_~x~0_531} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_360, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ~x$flush_delayed~0=v_~x$flush_delayed~0_160, ~x$w_buff1~0=v_~x$w_buff1~0_374, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_137, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_605, ~weak$$choice0~0=v_~weak$$choice0~0_118, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~x~0=v_~x~0_530, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:47,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [380] L749-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [437] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd0~0_361 256) 0)))) (let ((.cse10 (and .cse23 (not (= (mod v_~x$w_buff0_used~0_606 256) 0))))) (let ((.cse2 (ite .cse10 0 v_~x$w_buff0_used~0_606))) (let ((.cse18 (= (mod .cse2 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse12 (ite .cse22 0 v_~x$r_buff0_thd0~0_361)) (.cse20 (not (= 0 (mod v_~x$r_buff1_thd0~0_366 256))))) (let ((.cse11 (and .cse20 (not (= (mod v_~x$w_buff1_used~0_559 256) 0)))) (.cse13 (= (mod .cse12 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (ite (or .cse22 .cse11) 0 v_~x$w_buff1_used~0_559))) (let ((.cse19 (= (mod .cse16 256) 0)) (.cse4 (and .cse21 .cse15))) (let ((.cse5 (ite (or (and .cse20 (not .cse19)) .cse4) 0 v_~x$r_buff1_thd0~0_366))) (let ((.cse9 (= (mod .cse5 256) 0))) (let ((.cse17 (and .cse13 .cse19)) (.cse14 (and .cse9 .cse13))) (let ((.cse3 (or .cse17 .cse18 .cse14))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_140 (ite .cse4 v_~x$w_buff0~0_401 v_~x$w_buff1~0_375))) (.cse6 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (= (mod v_~x$w_buff0_used~0_605 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_171| v_~weak$$choice2~0_166) (= v_~main$tmp_guard0~0_137 (ite (= (ite (= v_~__unbuffered_cnt~0_255 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_main_#t~nondet9#1_167| v_~weak$$choice0~0_118) (= v_~x$w_buff1~0_375 v_~x$w_buff1~0_374) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|) (= v_~main$tmp_guard1~0_98 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_109 0) (= v_~__unbuffered_p1_EAX~0_122 2) (= 2 .cse0))) 1 0) 0) 0 1)) (= v_~x$flush_delayed~0_160 0) (= v_~x$w_buff0_used~0_605 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| (mod v_~main$tmp_guard0~0_137 256)) (= v_~x$w_buff0~0_401 v_~x$w_buff0~0_400) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= (ite .cse1 v_~x$mem_tmp~0_140 .cse0) v_~x~0_530) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~x$r_buff1_thd0~0_365 (ite .cse1 .cse5 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_360 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse9 .cse7))) .cse5 0))) (= (ite .cse10 v_~x$w_buff0~0_401 (ite .cse11 v_~x$w_buff1~0_375 v_~x~0_531)) v_~x$mem_tmp~0_140) (= v_~x$r_buff0_thd0~0_360 (ite .cse1 .cse12 (ite (or (and .cse13 .cse6) .cse8 .cse14) .cse12 (ite (and (not .cse8) .cse15) 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124| 0)) (= (ite .cse1 .cse16 (ite (or .cse17 .cse8 .cse14) .cse16 0)) v_~x$w_buff1_used~0_558))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_171|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_167|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ~x~0=v_~x~0_531} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_360, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ~x$flush_delayed~0=v_~x$flush_delayed~0_160, ~x$w_buff1~0=v_~x$w_buff1~0_374, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_137, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_605, ~weak$$choice0~0=v_~weak$$choice0~0_118, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~x~0=v_~x~0_530, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:48,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L749-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_11 (+ v_~__unbuffered_cnt~0_12 1)) (= |v_P0Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [437] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd0~0_361 256) 0)))) (let ((.cse10 (and .cse23 (not (= (mod v_~x$w_buff0_used~0_606 256) 0))))) (let ((.cse2 (ite .cse10 0 v_~x$w_buff0_used~0_606))) (let ((.cse18 (= (mod .cse2 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse12 (ite .cse22 0 v_~x$r_buff0_thd0~0_361)) (.cse20 (not (= 0 (mod v_~x$r_buff1_thd0~0_366 256))))) (let ((.cse11 (and .cse20 (not (= (mod v_~x$w_buff1_used~0_559 256) 0)))) (.cse13 (= (mod .cse12 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (ite (or .cse22 .cse11) 0 v_~x$w_buff1_used~0_559))) (let ((.cse19 (= (mod .cse16 256) 0)) (.cse4 (and .cse21 .cse15))) (let ((.cse5 (ite (or (and .cse20 (not .cse19)) .cse4) 0 v_~x$r_buff1_thd0~0_366))) (let ((.cse9 (= (mod .cse5 256) 0))) (let ((.cse17 (and .cse13 .cse19)) (.cse14 (and .cse9 .cse13))) (let ((.cse3 (or .cse17 .cse18 .cse14))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_140 (ite .cse4 v_~x$w_buff0~0_401 v_~x$w_buff1~0_375))) (.cse6 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (= (mod v_~x$w_buff0_used~0_605 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_171| v_~weak$$choice2~0_166) (= v_~main$tmp_guard0~0_137 (ite (= (ite (= v_~__unbuffered_cnt~0_255 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_main_#t~nondet9#1_167| v_~weak$$choice0~0_118) (= v_~x$w_buff1~0_375 v_~x$w_buff1~0_374) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|) (= v_~main$tmp_guard1~0_98 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_109 0) (= v_~__unbuffered_p1_EAX~0_122 2) (= 2 .cse0))) 1 0) 0) 0 1)) (= v_~x$flush_delayed~0_160 0) (= v_~x$w_buff0_used~0_605 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| (mod v_~main$tmp_guard0~0_137 256)) (= v_~x$w_buff0~0_401 v_~x$w_buff0~0_400) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= (ite .cse1 v_~x$mem_tmp~0_140 .cse0) v_~x~0_530) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~x$r_buff1_thd0~0_365 (ite .cse1 .cse5 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_360 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse9 .cse7))) .cse5 0))) (= (ite .cse10 v_~x$w_buff0~0_401 (ite .cse11 v_~x$w_buff1~0_375 v_~x~0_531)) v_~x$mem_tmp~0_140) (= v_~x$r_buff0_thd0~0_360 (ite .cse1 .cse12 (ite (or (and .cse13 .cse6) .cse8 .cse14) .cse12 (ite (and (not .cse8) .cse15) 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124| 0)) (= (ite .cse1 .cse16 (ite (or .cse17 .cse8 .cse14) .cse16 0)) v_~x$w_buff1_used~0_558))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_171|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_167|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ~x~0=v_~x~0_531} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_360, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ~x$flush_delayed~0=v_~x$flush_delayed~0_160, ~x$w_buff1~0=v_~x$w_buff1~0_374, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_137, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_605, ~weak$$choice0~0=v_~weak$$choice0~0_118, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~x~0=v_~x~0_530, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:48,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [311] L749-->L752: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [437] L813-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~x$r_buff0_thd0~0_361 256) 0)))) (let ((.cse10 (and .cse23 (not (= (mod v_~x$w_buff0_used~0_606 256) 0))))) (let ((.cse2 (ite .cse10 0 v_~x$w_buff0_used~0_606))) (let ((.cse18 (= (mod .cse2 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse12 (ite .cse22 0 v_~x$r_buff0_thd0~0_361)) (.cse20 (not (= 0 (mod v_~x$r_buff1_thd0~0_366 256))))) (let ((.cse11 (and .cse20 (not (= (mod v_~x$w_buff1_used~0_559 256) 0)))) (.cse13 (= (mod .cse12 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (ite (or .cse22 .cse11) 0 v_~x$w_buff1_used~0_559))) (let ((.cse19 (= (mod .cse16 256) 0)) (.cse4 (and .cse21 .cse15))) (let ((.cse5 (ite (or (and .cse20 (not .cse19)) .cse4) 0 v_~x$r_buff1_thd0~0_366))) (let ((.cse9 (= (mod .cse5 256) 0))) (let ((.cse17 (and .cse13 .cse19)) (.cse14 (and .cse9 .cse13))) (let ((.cse3 (or .cse17 .cse18 .cse14))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_140 (ite .cse4 v_~x$w_buff0~0_401 v_~x$w_buff1~0_375))) (.cse6 (= (mod v_~x$w_buff1_used~0_558 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_166 256) 0))) (.cse8 (= (mod v_~x$w_buff0_used~0_605 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_171| v_~weak$$choice2~0_166) (= v_~main$tmp_guard0~0_137 (ite (= (ite (= v_~__unbuffered_cnt~0_255 2) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_98 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_ULTIMATE.start_main_#t~nondet9#1_167| v_~weak$$choice0~0_118) (= v_~x$w_buff1~0_375 v_~x$w_buff1~0_374) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|) (= v_~main$tmp_guard1~0_98 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_109 0) (= v_~__unbuffered_p1_EAX~0_122 2) (= 2 .cse0))) 1 0) 0) 0 1)) (= v_~x$flush_delayed~0_160 0) (= v_~x$w_buff0_used~0_605 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108| (mod v_~main$tmp_guard0~0_137 256)) (= v_~x$w_buff0~0_401 v_~x$w_buff0~0_400) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= (ite .cse1 v_~x$mem_tmp~0_140 .cse0) v_~x~0_530) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~x$r_buff1_thd0~0_365 (ite .cse1 .cse5 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_360 256) 0))) (or (and .cse6 .cse7) .cse8 (and .cse9 .cse7))) .cse5 0))) (= (ite .cse10 v_~x$w_buff0~0_401 (ite .cse11 v_~x$w_buff1~0_375 v_~x~0_531)) v_~x$mem_tmp~0_140) (= v_~x$r_buff0_thd0~0_360 (ite .cse1 .cse12 (ite (or (and .cse13 .cse6) .cse8 .cse14) .cse12 (ite (and (not .cse8) .cse15) 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_124| 0)) (= (ite .cse1 .cse16 (ite (or .cse17 .cse8 .cse14) .cse16 0)) v_~x$w_buff1_used~0_558))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_171|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_167|, ~x$w_buff1~0=v_~x$w_buff1~0_375, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_559, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_366, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ~x~0=v_~x~0_531} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_360, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_109, ~x$flush_delayed~0=v_~x$flush_delayed~0_160, ~x$w_buff1~0=v_~x$w_buff1~0_374, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_558, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_98, ~x$mem_tmp~0=v_~x$mem_tmp~0_140, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_137, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_365, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_605, ~weak$$choice0~0=v_~weak$$choice0~0_118, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_122, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_124|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_255, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_97|, ~weak$$choice2~0=v_~weak$$choice2~0_166, ~x~0=v_~x~0_530, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_108|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:48,964 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:48:48,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6512 [2022-12-13 11:48:48,975 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 177 flow [2022-12-13 11:48:48,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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 11:48:48,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:48,975 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:48:48,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2117011605, now seen corresponding path program 1 times [2022-12-13 11:48:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:48,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907153778] [2022-12-13 11:48:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:49,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907153778] [2022-12-13 11:48:49,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907153778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:49,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:49,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:48:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886527529] [2022-12-13 11:48:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:49,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:48:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:48:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:48:49,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 11:48:49,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:49,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:49,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 11:48:49,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:49,251 INFO L130 PetriNetUnfolder]: 43/130 cut-off events. [2022-12-13 11:48:49,251 INFO L131 PetriNetUnfolder]: For 194/204 co-relation queries the response was YES. [2022-12-13 11:48:49,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 130 events. 43/130 cut-off events. For 194/204 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 519 event pairs, 6 based on Foata normal form. 16/119 useless extension candidates. Maximal degree in co-relation 468. Up to 76 conditions per place. [2022-12-13 11:48:49,252 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 22 selfloop transitions, 1 changer transitions 14/41 dead transitions. [2022-12-13 11:48:49,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 306 flow [2022-12-13 11:48:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:48:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:48:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-13 11:48:49,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-13 11:48:49,254 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 177 flow. Second operand 4 states and 60 transitions. [2022-12-13 11:48:49,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 306 flow [2022-12-13 11:48:49,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 213 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 11:48:49,258 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 106 flow [2022-12-13 11:48:49,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-13 11:48:49,259 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -18 predicate places. [2022-12-13 11:48:49,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:49,260 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 106 flow [2022-12-13 11:48:49,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:49,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:49,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 106 flow [2022-12-13 11:48:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 106 flow [2022-12-13 11:48:49,290 INFO L130 PetriNetUnfolder]: 9/42 cut-off events. [2022-12-13 11:48:49,290 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 11:48:49,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 42 events. 9/42 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 118 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 93. Up to 19 conditions per place. [2022-12-13 11:48:49,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 106 flow [2022-12-13 11:48:49,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-13 11:48:49,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:48:49,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 11:48:49,313 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 104 flow [2022-12-13 11:48:49,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:49,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:48:49,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:48:49,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:48:49,314 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:48:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:48:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash -260169959, now seen corresponding path program 1 times [2022-12-13 11:48:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:48:49,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53214421] [2022-12-13 11:48:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:48:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:48:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:48:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:48:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:48:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53214421] [2022-12-13 11:48:50,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53214421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:48:50,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:48:50,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:48:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385978576] [2022-12-13 11:48:50,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:48:50,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:48:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:48:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:48:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:48:50,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 11:48:50,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:48:50,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:48:50,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 11:48:50,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:48:50,214 INFO L130 PetriNetUnfolder]: 21/80 cut-off events. [2022-12-13 11:48:50,215 INFO L131 PetriNetUnfolder]: For 79/81 co-relation queries the response was YES. [2022-12-13 11:48:50,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 80 events. 21/80 cut-off events. For 79/81 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 321 event pairs, 0 based on Foata normal form. 8/65 useless extension candidates. Maximal degree in co-relation 228. Up to 38 conditions per place. [2022-12-13 11:48:50,215 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 17 selfloop transitions, 5 changer transitions 15/41 dead transitions. [2022-12-13 11:48:50,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 244 flow [2022-12-13 11:48:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:48:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:48:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-12-13 11:48:50,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4076086956521739 [2022-12-13 11:48:50,216 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 104 flow. Second operand 8 states and 75 transitions. [2022-12-13 11:48:50,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 244 flow [2022-12-13 11:48:50,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 227 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 11:48:50,217 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 111 flow [2022-12-13 11:48:50,218 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-13 11:48:50,218 INFO L295 CegarLoopForPetriNet]: 52 programPoint places, -16 predicate places. [2022-12-13 11:48:50,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:48:50,218 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 111 flow [2022-12-13 11:48:50,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:48:50,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:48:50,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 111 flow [2022-12-13 11:48:50,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 111 flow [2022-12-13 11:48:50,225 INFO L130 PetriNetUnfolder]: 9/40 cut-off events. [2022-12-13 11:48:50,225 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 11:48:50,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 40 events. 9/40 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 101 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 96. Up to 19 conditions per place. [2022-12-13 11:48:50,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 111 flow [2022-12-13 11:48:50,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-13 11:48:54,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L742: Formula: (and (= v_~x~0_562 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_562, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [447] L786-->P1EXIT: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_656 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_221 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_254 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_657 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_607 256) 0)) .cse2)) (.cse4 (and .cse3 .cse5))) (and (= v_~__unbuffered_cnt~0_283 (+ v_~__unbuffered_cnt~0_284 1)) (= v_~x~0_582 (ite .cse0 v_~x$w_buff0~0_445 (ite .cse1 v_~x$w_buff1~0_417 v_~x~0_583))) (= v_~x$r_buff1_thd2~0_220 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_606 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_253 256) 0)))) 0 v_~x$r_buff1_thd2~0_221)) (= (ite .cse0 0 v_~x$w_buff0_used~0_657) v_~x$w_buff0_used~0_656) (= |v_P1Thread1of1ForFork1_#res#1.base_49| 0) (= |v_P1Thread1of1ForFork1_#res#1.offset_49| 0) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_607) v_~x$w_buff1_used~0_606) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_254) v_~x$r_buff0_thd2~0_253)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_445, ~x$w_buff1~0=v_~x$w_buff1~0_417, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_607, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_284, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_254, ~x~0=v_~x~0_583, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_657} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_445, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_49|, ~x$w_buff1~0=v_~x$w_buff1~0_417, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_220, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_283, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_253, ~x~0=v_~x~0_582, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_49|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_656} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~x~0, P1Thread1of1ForFork1_#res#1.offset, ~x$w_buff0_used~0] [2022-12-13 11:48:54,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L742: Formula: (and (= v_~x~0_562 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_562, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [448] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse31 (not (= (mod v_~x$r_buff0_thd2~0_258 256) 0)))) (let ((.cse21 (and (not (= (mod v_~x$w_buff0_used~0_662 256) 0)) .cse31))) (let ((.cse32 (ite .cse21 0 v_~x$w_buff0_used~0_662))) (let ((.cse8 (not (= (mod .cse32 256) 0))) (.cse30 (not (= (mod v_~x$r_buff0_thd0~0_397 256) 0)))) (let ((.cse19 (and .cse8 .cse30))) (let ((.cse13 (ite .cse19 0 .cse32))) (let ((.cse24 (= (mod .cse13 256) 0)) (.cse7 (not (= (mod v_~x$r_buff1_thd2~0_225 256) 0)))) (let ((.cse22 (and .cse7 (not (= (mod v_~x$w_buff1_used~0_612 256) 0)))) (.cse23 (and .cse8 .cse31)) (.cse27 (not .cse24))) (let ((.cse28 (and .cse27 .cse30)) (.cse29 (ite (or .cse22 .cse23) 0 v_~x$w_buff1_used~0_612))) (let ((.cse6 (not (= (mod .cse29 256) 0))) (.cse26 (not (= (mod v_~x$r_buff1_thd0~0_402 256) 0))) (.cse16 (ite .cse28 0 v_~x$r_buff0_thd0~0_397))) (let ((.cse17 (= (mod .cse16 256) 0)) (.cse20 (and .cse6 .cse26))) (let ((.cse1 (ite (or .cse20 .cse28) 0 .cse29)) (.cse18 (not .cse17))) (let ((.cse15 (and .cse18 .cse27)) (.cse25 (= (mod .cse1 256) 0))) (let ((.cse9 (ite (or .cse15 (and (not .cse25) .cse26)) 0 v_~x$r_buff1_thd0~0_402))) (let ((.cse11 (= (mod .cse9 256) 0))) (let ((.cse2 (and .cse17 .cse11)) (.cse3 (and .cse25 .cse17))) (let ((.cse14 (or .cse2 .cse3 .cse24))) (let ((.cse5 (ite .cse14 v_~x$mem_tmp~0_160 (ite .cse15 v_~x$w_buff0~0_448 v_~x$w_buff1~0_420))) (.cse0 (not (= (mod v_~weak$$choice2~0_186 256) 0))) (.cse12 (= (mod v_~x$w_buff1_used~0_610 256) 0)) (.cse4 (= 0 (mod v_~x$w_buff0_used~0_660 256)))) (and (= |v_ULTIMATE.start_main_#t~nondet9#1_199| v_~weak$$choice0~0_138) (= |v_ULTIMATE.start_main_#t~nondet10#1_203| v_~weak$$choice2~0_186) (= (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 0)) v_~x$w_buff1_used~0_610) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_124| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_140|) (= v_~__unbuffered_cnt~0_287 (+ v_~__unbuffered_cnt~0_288 1)) (= v_~x~0_586 (ite .cse0 v_~x$mem_tmp~0_160 .cse5)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_140| 0)) (= v_~main$tmp_guard1~0_114 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_125 0) (= 2 .cse5) (= v_~__unbuffered_p1_EAX~0_142 2))) 1 0) 0) 0 1)) (= (ite (or (and .cse6 .cse7) (and .cse8 (not (= (mod v_~x$r_buff0_thd2~0_257 256) 0)))) 0 v_~x$r_buff1_thd2~0_225) v_~x$r_buff1_thd2~0_224) (= (ite .cse0 .cse9 (ite (let ((.cse10 (= 0 (mod v_~x$r_buff0_thd0~0_396 256)))) (or (and .cse10 .cse11) .cse4 (and .cse12 .cse10))) .cse9 0)) v_~x$r_buff1_thd0~0_401) (= (ite .cse0 .cse13 (ite .cse14 .cse13 (ite .cse15 0 .cse13))) v_~x$w_buff0_used~0_660) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_85| 0) (= v_~x$r_buff0_thd0~0_396 (ite .cse0 .cse16 (ite (or (and .cse12 .cse17) .cse2 .cse4) .cse16 (ite (and .cse18 (not .cse4)) 0 .cse16)))) (= (ite .cse19 v_~x$w_buff0~0_448 (ite .cse20 v_~x$w_buff1~0_420 (ite .cse21 v_~x$w_buff0~0_448 (ite .cse22 v_~x$w_buff1~0_420 v_~x~0_588)))) v_~x$mem_tmp~0_160) (= v_~x$w_buff1~0_419 v_~x$w_buff1~0_420) (= v_~x$w_buff0~0_448 v_~x$w_buff0~0_447) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_124| (mod v_~main$tmp_guard0~0_153 256)) (= v_~x$flush_delayed~0_180 0) (= (ite .cse23 0 v_~x$r_buff0_thd2~0_258) v_~x$r_buff0_thd2~0_257) (= (mod v_~main$tmp_guard1~0_114 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_85|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_287 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_153)))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_448, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_397, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_125, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_203|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_199|, ~x$w_buff1~0=v_~x$w_buff1~0_420, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_612, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_225, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_402, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_258, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_662, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_142, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_288, ~x~0=v_~x~0_588} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_447, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_85|, ~x$flush_delayed~0=v_~x$flush_delayed~0_180, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_114, ~x$mem_tmp~0=v_~x$mem_tmp~0_160, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_142, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_140|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_113|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_396, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_125, ~x$w_buff1~0=v_~x$w_buff1~0_419, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_610, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_224, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_153, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_401, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_257, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_660, ~weak$$choice0~0=v_~weak$$choice0~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_101|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_287, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~x~0=v_~x~0_586, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_124|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:55,060 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L742: Formula: (and (= v_~x~0_562 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_562, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [449] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse31 (not (= (mod v_~x$r_buff0_thd2~0_262 256) 0)))) (let ((.cse13 (and (not (= (mod v_~x$w_buff0_used~0_668 256) 0)) .cse31))) (let ((.cse32 (ite .cse13 0 v_~x$w_buff0_used~0_668))) (let ((.cse21 (not (= (mod .cse32 256) 0))) (.cse30 (not (= (mod v_~x$r_buff0_thd0~0_401 256) 0)))) (let ((.cse11 (and .cse21 .cse30))) (let ((.cse15 (ite .cse11 0 .cse32))) (let ((.cse23 (not (= (mod v_~x$r_buff1_thd2~0_229 256) 0))) (.cse24 (= (mod .cse15 256) 0))) (let ((.cse27 (not .cse24)) (.cse14 (and (not (= (mod v_~x$w_buff1_used~0_618 256) 0)) .cse23)) (.cse18 (and .cse31 .cse21))) (let ((.cse29 (ite (or .cse14 .cse18) 0 v_~x$w_buff1_used~0_618)) (.cse28 (and .cse27 .cse30))) (let ((.cse1 (ite .cse28 0 v_~x$r_buff0_thd0~0_401)) (.cse22 (not (= (mod .cse29 256) 0))) (.cse26 (not (= (mod v_~x$r_buff1_thd0~0_406 256) 0)))) (let ((.cse12 (and .cse22 .cse26)) (.cse4 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse4)) (.cse19 (ite (or .cse12 .cse28) 0 .cse29))) (let ((.cse25 (= (mod .cse19 256) 0)) (.cse17 (and .cse27 .cse6))) (let ((.cse8 (ite (or (and (not .cse25) .cse26) .cse17) 0 v_~x$r_buff1_thd0~0_406))) (let ((.cse10 (= (mod .cse8 256) 0))) (let ((.cse2 (and .cse10 .cse4)) (.cse20 (and .cse25 .cse4))) (let ((.cse16 (or .cse2 .cse24 .cse20))) (let ((.cse3 (= (mod v_~x$w_buff1_used~0_616 256) 0)) (.cse7 (ite .cse16 v_~x$mem_tmp~0_162 (ite .cse17 v_~x$w_buff0~0_452 v_~x$w_buff1~0_424))) (.cse0 (not (= (mod v_~weak$$choice2~0_188 256) 0))) (.cse5 (= (mod v_~x$w_buff0_used~0_666 256) 0))) (and (= v_~x$r_buff0_thd0~0_400 (ite .cse0 .cse1 (ite (or .cse2 (and .cse3 .cse4) .cse5) .cse1 (ite (and .cse6 (not .cse5)) 0 .cse1)))) (= v_~x$w_buff1~0_424 v_~x$w_buff1~0_423) (= (ite .cse0 v_~x$mem_tmp~0_162 .cse7) v_~x~0_592) (= v_~x$r_buff1_thd0~0_405 (ite .cse0 .cse8 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_400 256) 0))) (or (and .cse3 .cse9) (and .cse9 .cse10) .cse5)) .cse8 0))) (= (mod v_~main$tmp_guard1~0_116 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79|) (= v_~x$w_buff0~0_452 v_~x$w_buff0~0_451) (= (ite .cse11 v_~x$w_buff0~0_452 (ite .cse12 v_~x$w_buff1~0_424 (ite .cse13 v_~x$w_buff0~0_452 (ite .cse14 v_~x$w_buff1~0_424 v_~x~0_594)))) v_~x$mem_tmp~0_162) (= v_~x$w_buff0_used~0_666 (ite .cse0 .cse15 (ite .cse16 .cse15 (ite .cse17 0 .cse15)))) (= v_~x$flush_delayed~0_182 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_126| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_142|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_291 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_155) (= |v_ULTIMATE.start_main_#t~nondet10#1_207| v_~weak$$choice2~0_188) (= v_~main$tmp_guard1~0_116 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_144 2) (= v_~__unbuffered_p1_EBX~0_127 0) (= 2 .cse7))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_126| (mod v_~main$tmp_guard0~0_155 256)) (= |v_ULTIMATE.start_main_#t~nondet9#1_203| v_~weak$$choice0~0_140) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_142| 0)) (= |v_P1Thread1of1ForFork1_#res#1.base_51| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|) (= |v_P1Thread1of1ForFork1_#res#1.offset_51| 0) (= (+ v_~__unbuffered_cnt~0_292 1) v_~__unbuffered_cnt~0_291) (= (ite .cse18 0 v_~x$r_buff0_thd2~0_262) v_~x$r_buff0_thd2~0_261) (= (ite .cse0 .cse19 (ite (or .cse2 .cse20 .cse5) .cse19 0)) v_~x$w_buff1_used~0_616) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_261 256) 0)) .cse21) (and .cse22 .cse23)) 0 v_~x$r_buff1_thd2~0_229) v_~x$r_buff1_thd2~0_228)))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_452, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_401, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_127, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_207|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_203|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_618, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_229, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_406, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_262, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_292, ~x~0=v_~x~0_594} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_451, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|, ~x$flush_delayed~0=v_~x$flush_delayed~0_182, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ~x$mem_tmp~0=v_~x$mem_tmp~0_162, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_51|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_144, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_142|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_115|, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_51|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_400, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_127, ~x$w_buff1~0=v_~x$w_buff1~0_423, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_616, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_228, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_155, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_405, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_261, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_666, ~weak$$choice0~0=v_~weak$$choice0~0_140, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_103|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_188, ~x~0=v_~x~0_592, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_126|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#res#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre7#1, P1Thread1of1ForFork1_#res#1.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet8#1, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:55,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L742: Formula: (and (= v_~x~0_562 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_562, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [450] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse31 (not (= (mod v_~x$r_buff0_thd2~0_266 256) 0)))) (let ((.cse17 (and (not (= (mod v_~x$w_buff0_used~0_674 256) 0)) .cse31))) (let ((.cse32 (ite .cse17 0 v_~x$w_buff0_used~0_674))) (let ((.cse30 (not (= (mod v_~x$r_buff0_thd0~0_405 256) 0))) (.cse19 (not (= (mod .cse32 256) 0)))) (let ((.cse15 (and .cse30 .cse19))) (let ((.cse7 (ite .cse15 0 .cse32))) (let ((.cse24 (= (mod .cse7 256) 0)) (.cse21 (not (= (mod v_~x$r_buff1_thd2~0_233 256) 0)))) (let ((.cse14 (and .cse31 .cse19)) (.cse18 (and (not (= (mod v_~x$w_buff1_used~0_624 256) 0)) .cse21)) (.cse27 (not .cse24))) (let ((.cse28 (and .cse30 .cse27)) (.cse29 (ite (or .cse14 .cse18) 0 v_~x$w_buff1_used~0_624))) (let ((.cse20 (not (= (mod .cse29 256) 0))) (.cse26 (not (= (mod v_~x$r_buff1_thd0~0_410 256) 0))) (.cse10 (ite .cse28 0 v_~x$r_buff0_thd0~0_405))) (let ((.cse11 (= (mod .cse10 256) 0)) (.cse16 (and .cse20 .cse26))) (let ((.cse22 (ite (or .cse28 .cse16) 0 .cse29)) (.cse13 (not .cse11))) (let ((.cse9 (and .cse13 .cse27)) (.cse25 (= (mod .cse22 256) 0))) (let ((.cse1 (ite (or .cse9 (and (not .cse25) .cse26)) 0 v_~x$r_buff1_thd0~0_410))) (let ((.cse4 (= (mod .cse1 256) 0))) (let ((.cse12 (and .cse11 .cse4)) (.cse23 (and .cse11 .cse25))) (let ((.cse8 (or .cse24 .cse12 .cse23))) (let ((.cse6 (ite .cse8 v_~x$mem_tmp~0_164 (ite .cse9 v_~x$w_buff0~0_456 v_~x$w_buff1~0_428))) (.cse5 (= (mod v_~x$w_buff1_used~0_622 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_190 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_672 256) 0))) (and (= (ite .cse0 .cse1 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_404 256) 0))) (or .cse2 (and .cse3 .cse4) (and .cse5 .cse3))) .cse1 0)) v_~x$r_buff1_thd0~0_409) (= (ite .cse0 v_~x$mem_tmp~0_164 .cse6) v_~x~0_598) (= |v_ULTIMATE.start_main_#t~nondet9#1_207| v_~weak$$choice0~0_142) (= |v_ULTIMATE.start_main_#t~nondet10#1_211| v_~weak$$choice2~0_190) (= v_~x$flush_delayed~0_184 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_144| 0)) (= v_~main$tmp_guard1~0_118 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_146 2) (= .cse6 2) (= v_~__unbuffered_p1_EBX~0_129 0))) 1 0) 0) 0 1)) (= v_~__unbuffered_cnt~0_295 (+ v_~__unbuffered_cnt~0_296 1)) (= v_~x$w_buff0~0_456 v_~x$w_buff0~0_455) (= (mod v_~main$tmp_guard1~0_118 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_295 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_157) (= v_~x$w_buff0_used~0_672 (ite .cse0 .cse7 (ite .cse8 .cse7 (ite .cse9 0 .cse7)))) (= v_~x$w_buff1~0_428 v_~x$w_buff1~0_427) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_128| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_144|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89| 0) (= v_~x$r_buff0_thd0~0_404 (ite .cse0 .cse10 (ite (or .cse2 (and .cse5 .cse11) .cse12) .cse10 (ite (and .cse13 (not .cse2)) 0 .cse10)))) (= |v_P1Thread1of1ForFork1_#res#1.offset_53| 0) (= v_~x$r_buff0_thd2~0_265 (ite .cse14 0 v_~x$r_buff0_thd2~0_266)) (= (ite .cse15 v_~x$w_buff0~0_456 (ite .cse16 v_~x$w_buff1~0_428 (ite .cse17 v_~x$w_buff0~0_456 (ite .cse18 v_~x$w_buff1~0_428 v_~x~0_600)))) v_~x$mem_tmp~0_164) (= v_~x$r_buff1_thd2~0_232 (ite (or (and .cse19 (not (= (mod v_~x$r_buff0_thd2~0_265 256) 0))) (and .cse20 .cse21)) 0 v_~x$r_buff1_thd2~0_233)) (= (ite .cse0 .cse22 (ite (or .cse2 .cse12 .cse23) .cse22 0)) v_~x$w_buff1_used~0_622) (= |v_P1Thread1of1ForFork1_#res#1.base_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_128| (mod v_~main$tmp_guard0~0_157 256))))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_456, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_405, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_129, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_211|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_207|, ~x$w_buff1~0=v_~x$w_buff1~0_428, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_233, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_410, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_266, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_674, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_146, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_296, ~x~0=v_~x~0_600} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_455, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|, ~x$flush_delayed~0=v_~x$flush_delayed~0_184, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_118, ~x$mem_tmp~0=v_~x$mem_tmp~0_164, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_53|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_146, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_144|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_117|, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_53|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_404, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_129, ~x$w_buff1~0=v_~x$w_buff1~0_427, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_622, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_232, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_157, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_409, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_672, ~weak$$choice0~0=v_~weak$$choice0~0_142, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_105|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_190, ~x~0=v_~x~0_598, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_128|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, P1Thread1of1ForFork1_#res#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre7#1, P1Thread1of1ForFork1_#res#1.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet8#1, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:48:56,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L742: Formula: (and (= v_~x~0_562 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_562, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [451] L786-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_237 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_678 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_270 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_679 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_629 256) 0))))) (and (= v_~x$r_buff0_thd2~0_269 (ite .cse0 0 v_~x$r_buff0_thd2~0_270)) (= v_~x$w_buff0_used~0_678 (ite .cse1 0 v_~x$w_buff0_used~0_679)) (= v_~__unbuffered_cnt~0_299 (+ v_~__unbuffered_cnt~0_300 1)) (= v_~x$w_buff1_used~0_628 (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_629)) (= (ite .cse1 v_~x$w_buff0~0_459 (ite .cse2 v_~x$w_buff1~0_431 v_~x~0_605)) v_~x~0_604) (= v_~x$r_buff1_thd2~0_236 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_628 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_269 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_237))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_459, ~x$w_buff1~0=v_~x$w_buff1~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_629, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_300, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_270, ~x~0=v_~x~0_605, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_679} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_459, ~x$w_buff1~0=v_~x$w_buff1~0_431, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_236, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_628, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_299, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_269, ~x~0=v_~x~0_604, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_678} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:48:56,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] $Ultimate##0-->L742: Formula: (and (= v_~x~0_562 1) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_34 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~y~0=v_~y~0_34, ~x~0=v_~x~0_562, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [452] L786-->P1FINAL: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_241 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_682 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_274 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_683 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_633 256) 0))))) (and (= v_~x$w_buff1_used~0_632 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_633)) (= |v_P1Thread1of1ForFork1_#res#1.offset_55| 0) (= v_~x$w_buff0_used~0_682 (ite .cse2 0 v_~x$w_buff0_used~0_683)) (= v_~x$r_buff0_thd2~0_273 (ite .cse0 0 v_~x$r_buff0_thd2~0_274)) (= (ite .cse2 v_~x$w_buff0~0_461 (ite .cse1 v_~x$w_buff1~0_433 v_~x~0_609)) v_~x~0_608) (= v_~__unbuffered_cnt~0_303 (+ v_~__unbuffered_cnt~0_304 1)) (= v_~x$r_buff1_thd2~0_240 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_273 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_632 256))) .cse4)) 0 v_~x$r_buff1_thd2~0_241)) (= |v_P1Thread1of1ForFork1_#res#1.base_55| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_461, ~x$w_buff1~0=v_~x$w_buff1~0_433, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_241, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_633, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_304, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_274, ~x~0=v_~x~0_609, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_683} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_461, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_55|, ~x$w_buff1~0=v_~x$w_buff1~0_433, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_240, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_632, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_303, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_273, ~x~0=v_~x~0_608, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_55|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_682} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~x~0, P1Thread1of1ForFork1_#res#1.offset, ~x$w_buff0_used~0] [2022-12-13 11:48:56,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse31 (not (= (mod v_~x$r_buff0_thd2~0_307 256) 0)))) (let ((.cse7 (and .cse31 (not (= (mod v_~x$w_buff0_used~0_722 256) 0))))) (let ((.cse32 (ite .cse7 0 v_~x$w_buff0_used~0_722))) (let ((.cse17 (not (= (mod .cse32 256) 0))) (.cse30 (not (= (mod v_~x$r_buff0_thd0~0_419 256) 0)))) (let ((.cse5 (and .cse17 .cse30))) (let ((.cse14 (ite .cse5 0 .cse32))) (let ((.cse19 (not (= (mod v_~x$r_buff1_thd2~0_271 256) 0))) (.cse24 (= (mod .cse14 256) 0))) (let ((.cse27 (not .cse24)) (.cse8 (and .cse19 (not (= (mod v_~x$w_buff1_used~0_669 256) 0)))) (.cse13 (and .cse17 .cse31))) (let ((.cse29 (ite (or .cse8 .cse13) 0 v_~x$w_buff1_used~0_669)) (.cse28 (and .cse27 .cse30))) (let ((.cse21 (ite .cse28 0 v_~x$r_buff0_thd0~0_419)) (.cse18 (not (= (mod .cse29 256) 0))) (.cse26 (not (= (mod v_~x$r_buff1_thd0~0_424 256) 0)))) (let ((.cse6 (and .cse18 .cse26)) (.cse22 (= (mod .cse21 256) 0))) (let ((.cse23 (not .cse22)) (.cse1 (ite (or .cse6 .cse28) 0 .cse29))) (let ((.cse25 (= (mod .cse1 256) 0)) (.cse16 (and .cse27 .cse23))) (let ((.cse9 (ite (or (and (not .cse25) .cse26) .cse16) 0 v_~x$r_buff1_thd0~0_424))) (let ((.cse11 (= (mod .cse9 256) 0))) (let ((.cse3 (and .cse22 .cse25)) (.cse4 (and .cse22 .cse11))) (let ((.cse15 (or .cse24 .cse3 .cse4))) (let ((.cse12 (= (mod v_~x$w_buff1_used~0_668 256) 0)) (.cse2 (= (mod v_~x$w_buff0_used~0_721 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_194 256) 0))) (.cse20 (ite .cse15 v_~x$mem_tmp~0_168 (ite .cse16 v_~x$w_buff0~0_479 v_~x$w_buff1~0_451)))) (and (= (mod v_~main$tmp_guard1~0_122 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|) (= v_~x$w_buff1_used~0_668 (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 0))) (= |v_P1Thread1of1ForFork1_#res#1.base_65| 0) (= (ite .cse5 v_~x$w_buff0~0_479 (ite .cse6 v_~x$w_buff1~0_451 (ite .cse7 v_~x$w_buff0~0_479 (ite .cse8 v_~x$w_buff1~0_451 1)))) v_~x$mem_tmp~0_168) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= v_~x$r_buff1_thd0~0_423 (ite .cse0 .cse9 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_418 256) 0))) (or .cse2 (and .cse10 .cse11) (and .cse12 .cse10))) .cse9 0))) (= v_P0Thread1of1ForFork0_~arg.base_23 |v_P0Thread1of1ForFork0_#in~arg.base_23|) (= |v_P1Thread1of1ForFork1_#res#1.offset_65| 0) (= v_~x$w_buff1~0_451 v_~x$w_buff1~0_450) (= v_P0Thread1of1ForFork0_~arg.offset_23 |v_P0Thread1of1ForFork0_#in~arg.offset_23|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_333 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_161) (= v_~x$r_buff0_thd2~0_306 (ite .cse13 0 v_~x$r_buff0_thd2~0_307)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_148| 0)) (= (mod v_~main$tmp_guard0~0_161 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_132|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= v_~x$w_buff0_used~0_721 (ite .cse0 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14)))) (= v_~x$r_buff1_thd2~0_270 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_306 256) 0)) .cse17) (and .cse18 .cse19)) 0 v_~x$r_buff1_thd2~0_271)) (= |v_ULTIMATE.start_main_#t~nondet10#1_219| v_~weak$$choice2~0_194) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_132| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_148|) (= v_~__unbuffered_cnt~0_333 (+ v_~__unbuffered_cnt~0_334 1)) (= v_~x$w_buff0~0_479 v_~x$w_buff0~0_478) (= |v_ULTIMATE.start_main_#t~nondet9#1_215| v_~weak$$choice0~0_146) (= v_~y~0_42 1) (= v_~x$flush_delayed~0_188 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_133 0) (= .cse20 2) (= v_~__unbuffered_p1_EAX~0_150 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_122) (= v_~x$r_buff0_thd0~0_418 (ite .cse0 .cse21 (ite (or (and .cse22 .cse12) .cse2 .cse4) .cse21 (ite (and .cse23 (not .cse2)) 0 .cse21)))) (= (ite .cse0 v_~x$mem_tmp~0_168 .cse20) v_~x~0_647)))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_479, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_419, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_133, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_219|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_215|, ~x$w_buff1~0=v_~x$w_buff1~0_451, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_669, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_271, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_424, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_307, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_722, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_334} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_478, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~x$flush_delayed~0=v_~x$flush_delayed~0_188, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_122, ~x$mem_tmp~0=v_~x$mem_tmp~0_168, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_23, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_23|, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_150, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_148|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_121|, ~y~0=v_~y~0_42, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_65|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_23, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_418, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_133, ~x$w_buff1~0=v_~x$w_buff1~0_450, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_668, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_270, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_161, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_423, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_306, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_721, ~weak$$choice0~0=v_~weak$$choice0~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_109|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_194, ~x~0=v_~x~0_647, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_132|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1_#res#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre7#1, ~y~0, P1Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork0_~arg.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet8#1, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:48:57,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse31 (not (= (mod v_~x$r_buff0_thd2~0_311 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_726 256) 0)) .cse31))) (let ((.cse32 (ite .cse2 0 v_~x$w_buff0_used~0_726))) (let ((.cse11 (not (= 0 (mod .cse32 256)))) (.cse30 (not (= (mod v_~x$r_buff0_thd0~0_423 256) 0)))) (let ((.cse0 (and .cse11 .cse30))) (let ((.cse17 (ite .cse0 0 .cse32))) (let ((.cse24 (= (mod .cse17 256) 0)) (.cse9 (not (= (mod v_~x$r_buff1_thd2~0_275 256) 0)))) (let ((.cse3 (and .cse9 (not (= (mod v_~x$w_buff1_used~0_673 256) 0)))) (.cse23 (and .cse11 .cse31)) (.cse27 (not .cse24))) (let ((.cse28 (and .cse27 .cse30)) (.cse29 (ite (or .cse3 .cse23) 0 v_~x$w_buff1_used~0_673))) (let ((.cse26 (not (= 0 (mod v_~x$r_buff1_thd0~0_428 256)))) (.cse10 (not (= (mod .cse29 256) 0))) (.cse20 (ite .cse28 0 v_~x$r_buff0_thd0~0_423))) (let ((.cse21 (= (mod .cse20 256) 0)) (.cse1 (and .cse26 .cse10))) (let ((.cse5 (ite (or .cse1 .cse28) 0 .cse29)) (.cse22 (not .cse21))) (let ((.cse19 (and .cse22 .cse27)) (.cse25 (= (mod .cse5 256) 0))) (let ((.cse13 (ite (or .cse19 (and .cse26 (not .cse25))) 0 v_~x$r_buff1_thd0~0_428))) (let ((.cse15 (= (mod .cse13 256) 0))) (let ((.cse6 (and .cse15 .cse21)) (.cse7 (and .cse21 .cse25))) (let ((.cse18 (or .cse24 .cse6 .cse7))) (let ((.cse12 (ite .cse18 v_~x$mem_tmp~0_170 (ite .cse19 v_~x$w_buff0~0_483 v_~x$w_buff1~0_455))) (.cse4 (not (= (mod v_~weak$$choice2~0_196 256) 0))) (.cse16 (= (mod v_~x$w_buff1_used~0_672 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_725 256) 0))) (and (= (ite .cse0 v_~x$w_buff0~0_483 (ite .cse1 v_~x$w_buff1~0_455 (ite .cse2 v_~x$w_buff0~0_483 (ite .cse3 v_~x$w_buff1~0_455 1)))) v_~x$mem_tmp~0_170) (= (mod v_~main$tmp_guard1~0_124 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|) (= v_P0Thread1of1ForFork0_~arg.offset_25 |v_P0Thread1of1ForFork0_#in~arg.offset_25|) (= v_~x$w_buff1_used~0_672 (ite .cse4 .cse5 (ite (or .cse6 .cse7 .cse8) .cse5 0))) (= |v_P1Thread1of1ForFork1_#res#1.base_67| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_150| 0)) (= v_~x$flush_delayed~0_190 0) (= |v_ULTIMATE.start_main_#t~nondet10#1_223| v_~weak$$choice2~0_196) (= v_~x$w_buff0~0_483 v_~x$w_buff0~0_482) (= (ite (or (and .cse9 .cse10) (and (not (= (mod v_~x$r_buff0_thd2~0_310 256) 0)) .cse11)) 0 v_~x$r_buff1_thd2~0_275) v_~x$r_buff1_thd2~0_274) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_134| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_150|) (= v_~main$tmp_guard1~0_124 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_152 2) (= v_~__unbuffered_p1_EBX~0_135 0) (= 2 .cse12))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_427 (ite .cse4 .cse13 (ite (let ((.cse14 (= (mod v_~x$r_buff0_thd0~0_422 256) 0))) (or (and .cse14 .cse15) (and .cse14 .cse16) .cse8)) .cse13 0))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_134| (mod v_~main$tmp_guard0~0_163 256)) (= v_P0Thread1of1ForFork0_~arg.base_25 |v_P0Thread1of1ForFork0_#in~arg.base_25|) (= v_~y~0_44 1) (= |v_P1Thread1of1ForFork1_#res#1.offset_67| 0) (= v_~__unbuffered_cnt~0_337 (+ v_~__unbuffered_cnt~0_338 1)) (= (ite .cse4 .cse17 (ite .cse18 .cse17 (ite .cse19 0 .cse17))) v_~x$w_buff0_used~0_725) (= v_~main$tmp_guard0~0_163 (ite (= (ite (= v_~__unbuffered_cnt~0_337 2) 1 0) 0) 0 1)) (= (ite .cse4 v_~x$mem_tmp~0_170 .cse12) v_~x~0_651) (= v_~x$w_buff1~0_455 v_~x$w_buff1~0_454) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_95| 0) (= (ite .cse4 .cse20 (ite (or (and .cse16 .cse21) .cse6 .cse8) .cse20 (ite (and .cse22 (not .cse8)) 0 .cse20))) v_~x$r_buff0_thd0~0_422) (= |v_ULTIMATE.start_main_#t~nondet9#1_219| v_~weak$$choice0~0_148) (= (ite .cse23 0 v_~x$r_buff0_thd2~0_311) v_~x$r_buff0_thd2~0_310) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_95|)))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_483, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_423, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_135, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_223|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_219|, ~x$w_buff1~0=v_~x$w_buff1~0_455, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_673, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_275, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_428, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_311, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_726, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_152, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_338} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_482, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_95|, ~x$flush_delayed~0=v_~x$flush_delayed~0_190, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~x$mem_tmp~0=v_~x$mem_tmp~0_170, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_25, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_67|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_152, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_150|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_123|, ~y~0=v_~y~0_44, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_67|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_25, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_422, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_135, ~x$w_buff1~0=v_~x$w_buff1~0_454, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_672, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_274, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_163, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_427, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_310, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_725, ~weak$$choice0~0=v_~weak$$choice0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_87|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_111|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_337, ~weak$$choice2~0=v_~weak$$choice2~0_196, ~x~0=v_~x~0_651, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_134|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1_#res#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre7#1, ~y~0, P1Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork0_~arg.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet8#1, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:48:58,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] $Ultimate##0-->L796: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_279 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_729 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_315 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_730 256) 0)) .cse5)) (.cse1 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_677 256) 0)) .cse3))) (and (= v_~__unbuffered_cnt~0_341 (+ v_~__unbuffered_cnt~0_342 1)) (= v_P0Thread1of1ForFork0_~arg.base_27 |v_P0Thread1of1ForFork0_#in~arg.base_27|) (= (ite .cse0 0 v_~x$w_buff0_used~0_730) v_~x$w_buff0_used~0_729) (= v_~y~0_46 1) (= v_~x$r_buff0_thd2~0_314 (ite .cse1 0 v_~x$r_buff0_thd2~0_315)) (= (ite .cse0 v_~x$w_buff0~0_486 (ite .cse2 v_~x$w_buff1~0_458 1)) v_~x~0_655) (= v_P0Thread1of1ForFork0_~arg.offset_27 |v_P0Thread1of1ForFork0_#in~arg.offset_27|) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_676 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_314 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_279) v_~x$r_buff1_thd2~0_278) (= v_~x$w_buff1_used~0_676 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_677))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_486, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_458, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_279, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_677, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_342, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_730} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_486, ~x$w_buff1~0=v_~x$w_buff1~0_458, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_278, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_676, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_314, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_729, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_341, ~y~0=v_~y~0_46, ~x~0=v_~x~0_655, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_27} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:48:58,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->P1FINAL: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_283 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_733 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_319 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_681 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_734 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_681) v_~x$w_buff1_used~0_680) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_319) v_~x$r_buff0_thd2~0_318) (= (ite .cse2 v_~x$w_buff0~0_488 (ite .cse1 v_~x$w_buff1~0_460 1)) v_~x~0_659) (= v_~x$r_buff1_thd2~0_282 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_318 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_680 256) 0)))) 0 v_~x$r_buff1_thd2~0_283)) (= |v_P1Thread1of1ForFork1_#res#1.base_69| 0) (= |v_P1Thread1of1ForFork1_#res#1.offset_69| 0) (= v_~__unbuffered_cnt~0_345 (+ v_~__unbuffered_cnt~0_346 1)) (= v_P0Thread1of1ForFork0_~arg.base_29 |v_P0Thread1of1ForFork0_#in~arg.base_29|) (= (ite .cse2 0 v_~x$w_buff0_used~0_734) v_~x$w_buff0_used~0_733) (= v_P0Thread1of1ForFork0_~arg.offset_29 |v_P0Thread1of1ForFork0_#in~arg.offset_29|) (= v_~y~0_48 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_488, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_460, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_681, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_346, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_319, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_734} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_488, ~x$w_buff1~0=v_~x$w_buff1~0_460, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_282, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_680, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_318, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_29, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_733, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_29|, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_69|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_345, ~y~0=v_~y~0_48, ~x~0=v_~x~0_659, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_69|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P1Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:48:58,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->P1EXIT: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_263 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_299 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_713 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_714 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_661 256) 0)) .cse3))) (and (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= |v_P1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~y~0_38 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (= v_~x$w_buff1_used~0_660 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_661)) (= v_~__unbuffered_cnt~0_325 (+ v_~__unbuffered_cnt~0_326 1)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_298 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_660 256) 0)))) 0 v_~x$r_buff1_thd2~0_263) v_~x$r_buff1_thd2~0_262) (= v_~x$r_buff0_thd2~0_298 (ite .cse1 0 v_~x$r_buff0_thd2~0_299)) (= |v_P1Thread1of1ForFork1_#res#1.base_63| 0) (= v_~x$w_buff0_used~0_713 (ite .cse4 0 v_~x$w_buff0_used~0_714)) (= (ite .cse4 v_~x$w_buff0~0_472 (ite .cse0 v_~x$w_buff1~0_444 1)) v_~x~0_639)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_472, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_444, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_661, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_326, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_299, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_714} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_472, ~x$w_buff1~0=v_~x$w_buff1~0_444, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_262, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_660, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_298, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_713, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_63|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_325, ~y~0=v_~y~0_38, ~x~0=v_~x~0_639, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_63|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P1Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:48:58,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse31 (not (= 0 (mod v_~x$r_buff0_thd2~0_303 256))))) (let ((.cse2 (and .cse31 (not (= (mod v_~x$w_buff0_used~0_718 256) 0))))) (let ((.cse32 (ite .cse2 0 v_~x$w_buff0_used~0_718))) (let ((.cse11 (not (= (mod .cse32 256) 0))) (.cse30 (not (= (mod v_~x$r_buff0_thd0~0_415 256) 0)))) (let ((.cse0 (and .cse11 .cse30))) (let ((.cse18 (ite .cse0 0 .cse32))) (let ((.cse9 (not (= (mod v_~x$r_buff1_thd2~0_267 256) 0))) (.cse24 (= (mod .cse18 256) 0))) (let ((.cse27 (not .cse24)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_665 256) 0)) .cse9)) (.cse12 (and .cse31 .cse11))) (let ((.cse29 (ite (or .cse3 .cse12) 0 v_~x$w_buff1_used~0_665)) (.cse28 (and .cse27 .cse30))) (let ((.cse21 (ite .cse28 0 v_~x$r_buff0_thd0~0_415)) (.cse26 (not (= (mod v_~x$r_buff1_thd0~0_420 256) 0))) (.cse10 (not (= (mod .cse29 256) 0)))) (let ((.cse1 (and .cse26 .cse10)) (.cse22 (= (mod .cse21 256) 0))) (let ((.cse23 (not .cse22)) (.cse5 (ite (or .cse1 .cse28) 0 .cse29))) (let ((.cse25 (= (mod .cse5 256) 0)) (.cse20 (and .cse27 .cse23))) (let ((.cse14 (ite (or (and (not .cse25) .cse26) .cse20) 0 v_~x$r_buff1_thd0~0_420))) (let ((.cse16 (= (mod .cse14 256) 0))) (let ((.cse7 (and .cse22 .cse25)) (.cse8 (and .cse22 .cse16))) (let ((.cse19 (or .cse24 .cse7 .cse8))) (let ((.cse13 (ite .cse19 v_~x$mem_tmp~0_166 (ite .cse20 v_~x$w_buff0~0_475 v_~x$w_buff1~0_447))) (.cse4 (not (= (mod v_~weak$$choice2~0_192 256) 0))) (.cse17 (= (mod v_~x$w_buff1_used~0_664 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_717 256) 0))) (and (= |v_ULTIMATE.start_main_#t~nondet10#1_215| v_~weak$$choice2~0_192) (= v_~y~0_40 1) (= (ite (= (ite (= v_~__unbuffered_cnt~0_329 2) 1 0) 0) 0 1) v_~main$tmp_guard0~0_159) (= v_~__unbuffered_cnt~0_329 (+ v_~__unbuffered_cnt~0_330 1)) (= (ite .cse0 v_~x$w_buff0~0_475 (ite .cse1 v_~x$w_buff1~0_447 (ite .cse2 v_~x$w_buff0~0_475 (ite .cse3 v_~x$w_buff1~0_447 1)))) v_~x$mem_tmp~0_166) (= v_~x$flush_delayed~0_186 0) (= |v_ULTIMATE.start_main_#t~nondet9#1_211| v_~weak$$choice0~0_144) (= v_~x$w_buff1~0_447 v_~x$w_buff1~0_446) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_91| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_130| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_146|) (= (mod v_~main$tmp_guard1~0_120 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_130| (mod v_~main$tmp_guard0~0_159 256)) (= v_~x$w_buff1_used~0_664 (ite .cse4 .cse5 (ite (or .cse6 .cse7 .cse8) .cse5 0))) (= v_~x$r_buff1_thd2~0_266 (ite (or (and .cse9 .cse10) (and (not (= 0 (mod v_~x$r_buff0_thd2~0_302 256))) .cse11)) 0 v_~x$r_buff1_thd2~0_267)) (= (ite .cse12 0 v_~x$r_buff0_thd2~0_303) v_~x$r_buff0_thd2~0_302) (= (ite .cse4 v_~x$mem_tmp~0_166 .cse13) v_~x~0_643) (= v_~x$r_buff1_thd0~0_419 (ite .cse4 .cse14 (ite (let ((.cse15 (= 0 (mod v_~x$r_buff0_thd0~0_414 256)))) (or .cse6 (and .cse15 .cse16) (and .cse15 .cse17))) .cse14 0))) (= (ite .cse4 .cse18 (ite .cse19 .cse18 (ite .cse20 0 .cse18))) v_~x$w_buff0_used~0_717) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_146| 0)) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_91|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_131 0) (= v_~__unbuffered_p1_EAX~0_148 2) (= 2 .cse13))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_120) (= v_~x$r_buff0_thd0~0_414 (ite .cse4 .cse21 (ite (or .cse6 .cse8 (and .cse22 .cse17)) .cse21 (ite (and .cse23 (not .cse6)) 0 .cse21)))) (= v_~x$w_buff0~0_475 v_~x$w_buff0~0_474)))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_475, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_415, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_215|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_211|, ~x$w_buff1~0=v_~x$w_buff1~0_447, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_665, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_420, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_303, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_718, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_148, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_330} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_474, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_91|, ~x$flush_delayed~0=v_~x$flush_delayed~0_186, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_120, ~x$mem_tmp~0=v_~x$mem_tmp~0_166, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_148, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_146|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_119|, ~y~0=v_~y~0_40, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_414, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~x$w_buff1~0=v_~x$w_buff1~0_446, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_664, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_266, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_159, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_419, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_717, ~weak$$choice0~0=v_~weak$$choice0~0_144, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_107|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_329, ~weak$$choice2~0=v_~weak$$choice2~0_192, ~x~0=v_~x~0_643, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_130|} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, P0Thread1of1ForFork0_~arg.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre7#1, ~y~0, P0Thread1of1ForFork0_~arg.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet8#1, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [310] L742-->L749: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_129 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_130 256) 0)) .cse5)) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_121 256) 0))))) (and (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_120 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= (ite .cse2 0 v_~x$w_buff0_used~0_130) v_~x$w_buff0_used~0_129) (= v_~x$r_buff0_thd1~0_23 (ite .cse3 0 v_~x$r_buff0_thd1~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_121) v_~x$w_buff1_used~0_120) (= v_~x~0_99 (ite .cse2 v_~x$w_buff0~0_67 (ite .cse4 v_~x$w_buff1~0_74 v_~x~0_100)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_67, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_74, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_120, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_129} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0]