/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:46:44,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:46:44,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:46:44,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:46:44,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:46:44,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:46:44,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:46:44,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:46:44,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:46:44,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:46:44,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:46:44,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:46:44,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:46:44,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:46:44,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:46:44,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:46:44,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:46:44,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:46:44,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:46:44,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:46:44,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:46:44,145 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:46:44,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:46:44,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:46:44,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:46:44,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:46:44,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:46:44,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:46:44,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:46:44,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:46:44,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:46:44,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:46:44,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:46:44,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:46:44,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:46:44,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:46:44,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:46:44,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:46:44,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:46:44,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:46:44,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:46:44,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:46:44,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:46:44,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:46:44,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:46:44,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:46:44,182 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:46:44,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:46:44,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:46:44,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:46:44,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:46:44,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:46:44,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:46:44,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:46:44,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:46:44,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:46:44,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:46:44,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:44,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:46:44,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:46:44,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:46:44,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:46:44,186 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:46:44,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:46:44,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:46:44,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:46:44,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:46:44,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:46:44,469 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:46:44,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2022-12-13 00:46:45,546 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:46:45,785 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:46:45,786 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.i [2022-12-13 00:46:45,794 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3757d0d/a5ae070effea44a98670b55f2a11b1f4/FLAG18693a4e2 [2022-12-13 00:46:45,805 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3757d0d/a5ae070effea44a98670b55f2a11b1f4 [2022-12-13 00:46:45,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:46:45,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:46:45,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:45,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:46:45,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:46:45,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:45" (1/1) ... [2022-12-13 00:46:45,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4267cb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:45, skipping insertion in model container [2022-12-13 00:46:45,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:46:45" (1/1) ... [2022-12-13 00:46:45,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:46:45,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:46:45,933 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/rfi002_tso.i[987,1000] [2022-12-13 00:46:46,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:46,122 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:46:46,130 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/rfi002_tso.i[987,1000] [2022-12-13 00:46:46,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:46:46,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:46:46,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:46:46,214 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:46:46,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46 WrapperNode [2022-12-13 00:46:46,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:46:46,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:46,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:46:46,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:46:46,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,282 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 203 [2022-12-13 00:46:46,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:46:46,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:46:46,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:46:46,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:46:46,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,315 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:46:46,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:46:46,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:46:46,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:46:46,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (1/1) ... [2022-12-13 00:46:46,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:46:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:46:46,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:46:46,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:46:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:46:46,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:46:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:46:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:46:46,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:46:46,416 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:46:46,500 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:46:46,501 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:46:46,861 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:46:47,100 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:46:47,100 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:46:47,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:47 BoogieIcfgContainer [2022-12-13 00:46:47,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:46:47,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:46:47,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:46:47,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:46:47,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:46:45" (1/3) ... [2022-12-13 00:46:47,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674ab646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:47, skipping insertion in model container [2022-12-13 00:46:47,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:46:46" (2/3) ... [2022-12-13 00:46:47,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674ab646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:46:47, skipping insertion in model container [2022-12-13 00:46:47,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:46:47" (3/3) ... [2022-12-13 00:46:47,112 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi002_tso.i [2022-12-13 00:46:47,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:46:47,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 00:46:47,149 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:46:47,237 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:46:47,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 224 flow [2022-12-13 00:46:47,306 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:46:47,306 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:47,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:46:47,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 107 transitions, 224 flow [2022-12-13 00:46:47,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 216 flow [2022-12-13 00:46:47,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:47,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 216 flow [2022-12-13 00:46:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 216 flow [2022-12-13 00:46:47,380 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:46:47,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:47,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:46:47,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 216 flow [2022-12-13 00:46:47,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 1314 [2022-12-13 00:46:54,856 INFO L241 LiptonReduction]: Total number of compositions: 89 [2022-12-13 00:46:54,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:46:54,880 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;@1f2eb88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:46:54,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:46:54,884 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 00:46:54,884 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:54,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:54,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:46:54,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:46:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:54,889 INFO L85 PathProgramCache]: Analyzing trace with hash 594178864, now seen corresponding path program 1 times [2022-12-13 00:46:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:54,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278000509] [2022-12-13 00:46:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:55,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278000509] [2022-12-13 00:46:55,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278000509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:55,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:55,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954999179] [2022-12-13 00:46:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:55,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:55,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:55,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 50 [2022-12-13 00:46:55,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:55,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:55,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 50 [2022-12-13 00:46:55,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:55,864 INFO L130 PetriNetUnfolder]: 2590/4303 cut-off events. [2022-12-13 00:46:55,865 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 00:46:55,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8440 conditions, 4303 events. 2590/4303 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 26653 event pairs, 150 based on Foata normal form. 0/2489 useless extension candidates. Maximal degree in co-relation 8430. Up to 3785 conditions per place. [2022-12-13 00:46:55,880 INFO L137 encePairwiseOnDemand]: 44/50 looper letters, 68 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2022-12-13 00:46:55,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 296 flow [2022-12-13 00:46:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-13 00:46:55,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2022-12-13 00:46:55,889 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 106 flow. Second operand 3 states and 92 transitions. [2022-12-13 00:46:55,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 296 flow [2022-12-13 00:46:55,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:55,894 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 100 flow [2022-12-13 00:46:55,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-13 00:46:55,898 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2022-12-13 00:46:55,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:55,898 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 100 flow [2022-12-13 00:46:55,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:55,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:55,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 100 flow [2022-12-13 00:46:55,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 100 flow [2022-12-13 00:46:55,915 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-12-13 00:46:55,915 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:55,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 192 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:46:55,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 100 flow [2022-12-13 00:46:55,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-13 00:46:56,055 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:56,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 00:46:56,058 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 100 flow [2022-12-13 00:46:56,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:56,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:56,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 00:46:56,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:46:56,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:46:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1239676109, now seen corresponding path program 1 times [2022-12-13 00:46:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888401734] [2022-12-13 00:46:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888401734] [2022-12-13 00:46:56,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888401734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:56,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:56,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931507047] [2022-12-13 00:46:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:56,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 46 [2022-12-13 00:46:56,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:56,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:56,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 46 [2022-12-13 00:46:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:56,785 INFO L130 PetriNetUnfolder]: 2285/3839 cut-off events. [2022-12-13 00:46:56,785 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 00:46:56,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 3839 events. 2285/3839 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22943 event pairs, 455 based on Foata normal form. 0/2357 useless extension candidates. Maximal degree in co-relation 7661. Up to 2839 conditions per place. [2022-12-13 00:46:56,794 INFO L137 encePairwiseOnDemand]: 43/46 looper letters, 27 selfloop transitions, 2 changer transitions 40/74 dead transitions. [2022-12-13 00:46:56,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 74 transitions, 294 flow [2022-12-13 00:46:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 00:46:56,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6159420289855072 [2022-12-13 00:46:56,797 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 100 flow. Second operand 3 states and 85 transitions. [2022-12-13 00:46:56,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 74 transitions, 294 flow [2022-12-13 00:46:56,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:56,800 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 58 flow [2022-12-13 00:46:56,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2022-12-13 00:46:56,801 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2022-12-13 00:46:56,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:56,801 INFO L89 Accepts]: Start accepts. Operand has 52 places, 25 transitions, 58 flow [2022-12-13 00:46:56,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:56,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:56,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 58 flow [2022-12-13 00:46:56,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 58 flow [2022-12-13 00:46:56,805 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:46:56,805 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:56,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:46:56,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 58 flow [2022-12-13 00:46:56,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 00:46:56,905 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:56,906 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 00:46:56,907 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 58 flow [2022-12-13 00:46:56,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:56,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:56,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:56,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:46:56,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:46:56,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash -224708514, now seen corresponding path program 1 times [2022-12-13 00:46:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:56,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658414952] [2022-12-13 00:46:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:56,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:57,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658414952] [2022-12-13 00:46:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658414952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:57,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:57,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:46:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862454249] [2022-12-13 00:46:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:57,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:57,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:57,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:57,336 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:57,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:57,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:57,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:57,491 INFO L130 PetriNetUnfolder]: 300/557 cut-off events. [2022-12-13 00:46:57,491 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 00:46:57,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 557 events. 300/557 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2449 event pairs, 116 based on Foata normal form. 24/522 useless extension candidates. Maximal degree in co-relation 1107. Up to 345 conditions per place. [2022-12-13 00:46:57,496 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 29 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-13 00:46:57,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2022-12-13 00:46:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-13 00:46:57,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-13 00:46:57,498 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 58 flow. Second operand 3 states and 47 transitions. [2022-12-13 00:46:57,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2022-12-13 00:46:57,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:57,499 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:57,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=62, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 00:46:57,500 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -23 predicate places. [2022-12-13 00:46:57,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:57,500 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:57,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:57,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:57,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:57,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:57,504 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:46:57,505 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:46:57,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:46:57,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:57,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 00:46:57,506 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:57,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 00:46:57,507 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 62 flow [2022-12-13 00:46:57,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:57,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:57,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:46:57,508 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:46:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:57,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1312635138, now seen corresponding path program 1 times [2022-12-13 00:46:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:57,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136202325] [2022-12-13 00:46:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136202325] [2022-12-13 00:46:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136202325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:57,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:46:57,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578239946] [2022-12-13 00:46:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:57,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:46:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:57,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:46:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:46:57,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:57,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:57,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:57,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:57,764 INFO L130 PetriNetUnfolder]: 279/516 cut-off events. [2022-12-13 00:46:57,765 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 00:46:57,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 516 events. 279/516 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2033 event pairs, 104 based on Foata normal form. 12/472 useless extension candidates. Maximal degree in co-relation 1080. Up to 317 conditions per place. [2022-12-13 00:46:57,766 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 00:46:57,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 137 flow [2022-12-13 00:46:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:46:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:46:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 00:46:57,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 00:46:57,770 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 62 flow. Second operand 3 states and 44 transitions. [2022-12-13 00:46:57,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 137 flow [2022-12-13 00:46:57,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:57,770 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 66 flow [2022-12-13 00:46:57,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-13 00:46:57,772 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -22 predicate places. [2022-12-13 00:46:57,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:57,773 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 66 flow [2022-12-13 00:46:57,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:57,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:57,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 66 flow [2022-12-13 00:46:57,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 66 flow [2022-12-13 00:46:57,778 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:46:57,780 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:46:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:46:57,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 66 flow [2022-12-13 00:46:57,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-13 00:46:57,783 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:57,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 00:46:57,787 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 66 flow [2022-12-13 00:46:57,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:57,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:57,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:57,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:46:57,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:46:57,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:57,788 INFO L85 PathProgramCache]: Analyzing trace with hash -849668527, now seen corresponding path program 1 times [2022-12-13 00:46:57,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:57,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170784949] [2022-12-13 00:46:57,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:59,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170784949] [2022-12-13 00:46:59,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170784949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:59,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:59,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 00:46:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653805537] [2022-12-13 00:46:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:46:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:46:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:46:59,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:46:59,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 66 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:59,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:59,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:46:59,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:59,576 INFO L130 PetriNetUnfolder]: 387/703 cut-off events. [2022-12-13 00:46:59,576 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 00:46:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 703 events. 387/703 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3165 event pairs, 12 based on Foata normal form. 9/644 useless extension candidates. Maximal degree in co-relation 1531. Up to 407 conditions per place. [2022-12-13 00:46:59,579 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 43 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2022-12-13 00:46:59,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 277 flow [2022-12-13 00:46:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:46:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:46:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-13 00:46:59,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5542857142857143 [2022-12-13 00:46:59,581 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 66 flow. Second operand 7 states and 97 transitions. [2022-12-13 00:46:59,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 277 flow [2022-12-13 00:46:59,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:59,584 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 175 flow [2022-12-13 00:46:59,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2022-12-13 00:46:59,586 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2022-12-13 00:46:59,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:59,586 INFO L89 Accepts]: Start accepts. Operand has 41 places, 41 transitions, 175 flow [2022-12-13 00:46:59,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:59,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:59,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 41 transitions, 175 flow [2022-12-13 00:46:59,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 175 flow [2022-12-13 00:46:59,600 INFO L130 PetriNetUnfolder]: 20/92 cut-off events. [2022-12-13 00:46:59,600 INFO L131 PetriNetUnfolder]: For 19/20 co-relation queries the response was YES. [2022-12-13 00:46:59,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 92 events. 20/92 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 3 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 203. Up to 33 conditions per place. [2022-12-13 00:46:59,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 41 transitions, 175 flow [2022-12-13 00:46:59,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 00:46:59,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:46:59,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:46:59,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 397 [2022-12-13 00:46:59,983 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 174 flow [2022-12-13 00:46:59,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:59,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:59,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:46:59,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:46:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1827513771, now seen corresponding path program 2 times [2022-12-13 00:46:59,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:59,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237066373] [2022-12-13 00:46:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:00,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237066373] [2022-12-13 00:47:00,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237066373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:00,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:00,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:00,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103239680] [2022-12-13 00:47:00,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:00,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:00,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 00:47:00,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:00,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:00,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 00:47:00,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:01,034 INFO L130 PetriNetUnfolder]: 379/685 cut-off events. [2022-12-13 00:47:01,034 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-13 00:47:01,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 685 events. 379/685 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3032 event pairs, 100 based on Foata normal form. 4/622 useless extension candidates. Maximal degree in co-relation 1953. Up to 311 conditions per place. [2022-12-13 00:47:01,038 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 45 selfloop transitions, 10 changer transitions 0/60 dead transitions. [2022-12-13 00:47:01,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 356 flow [2022-12-13 00:47:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-13 00:47:01,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-13 00:47:01,040 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 174 flow. Second operand 5 states and 70 transitions. [2022-12-13 00:47:01,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 356 flow [2022-12-13 00:47:01,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 356 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:47:01,042 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 221 flow [2022-12-13 00:47:01,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2022-12-13 00:47:01,042 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -10 predicate places. [2022-12-13 00:47:01,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:01,042 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 221 flow [2022-12-13 00:47:01,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:01,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:01,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 221 flow [2022-12-13 00:47:01,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 43 transitions, 221 flow [2022-12-13 00:47:01,084 INFO L130 PetriNetUnfolder]: 46/178 cut-off events. [2022-12-13 00:47:01,084 INFO L131 PetriNetUnfolder]: For 145/150 co-relation queries the response was YES. [2022-12-13 00:47:01,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 178 events. 46/178 cut-off events. For 145/150 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 909 event pairs, 6 based on Foata normal form. 5/151 useless extension candidates. Maximal degree in co-relation 478. Up to 69 conditions per place. [2022-12-13 00:47:01,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 43 transitions, 221 flow [2022-12-13 00:47:01,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-13 00:47:01,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:01,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [532] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 00:47:01,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:01,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 445 [2022-12-13 00:47:01,487 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 225 flow [2022-12-13 00:47:01,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:01,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:01,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:01,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:47:01,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash -241693662, now seen corresponding path program 1 times [2022-12-13 00:47:01,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:01,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673437097] [2022-12-13 00:47:01,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:01,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673437097] [2022-12-13 00:47:02,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673437097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:02,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:02,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784094299] [2022-12-13 00:47:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:02,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:02,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:02,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:02,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:47:02,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:02,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:02,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:47:02,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:02,963 INFO L130 PetriNetUnfolder]: 517/957 cut-off events. [2022-12-13 00:47:02,963 INFO L131 PetriNetUnfolder]: For 1175/1175 co-relation queries the response was YES. [2022-12-13 00:47:02,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 957 events. 517/957 cut-off events. For 1175/1175 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4875 event pairs, 36 based on Foata normal form. 5/860 useless extension candidates. Maximal degree in co-relation 3187. Up to 314 conditions per place. [2022-12-13 00:47:02,968 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 79 selfloop transitions, 45 changer transitions 0/129 dead transitions. [2022-12-13 00:47:02,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 129 transitions, 913 flow [2022-12-13 00:47:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:47:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:47:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-12-13 00:47:02,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 00:47:02,970 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 225 flow. Second operand 9 states and 135 transitions. [2022-12-13 00:47:02,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 129 transitions, 913 flow [2022-12-13 00:47:02,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 129 transitions, 875 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:02,976 INFO L231 Difference]: Finished difference. Result has 54 places, 83 transitions, 636 flow [2022-12-13 00:47:02,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=636, PETRI_PLACES=54, PETRI_TRANSITIONS=83} [2022-12-13 00:47:02,977 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2022-12-13 00:47:02,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:02,977 INFO L89 Accepts]: Start accepts. Operand has 54 places, 83 transitions, 636 flow [2022-12-13 00:47:02,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:02,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:02,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 83 transitions, 636 flow [2022-12-13 00:47:02,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 83 transitions, 636 flow [2022-12-13 00:47:03,023 INFO L130 PetriNetUnfolder]: 135/374 cut-off events. [2022-12-13 00:47:03,023 INFO L131 PetriNetUnfolder]: For 715/749 co-relation queries the response was YES. [2022-12-13 00:47:03,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 374 events. 135/374 cut-off events. For 715/749 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2281 event pairs, 4 based on Foata normal form. 8/329 useless extension candidates. Maximal degree in co-relation 1457. Up to 153 conditions per place. [2022-12-13 00:47:03,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 83 transitions, 636 flow [2022-12-13 00:47:03,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 00:47:03,030 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:03,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 00:47:03,031 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 83 transitions, 636 flow [2022-12-13 00:47:03,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:03,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:03,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:03,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:47:03,031 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1351618486, now seen corresponding path program 1 times [2022-12-13 00:47:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981226171] [2022-12-13 00:47:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981226171] [2022-12-13 00:47:03,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981226171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:03,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:03,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:47:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617889755] [2022-12-13 00:47:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:03,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:47:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:03,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:47:03,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:47:03,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:47:03,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 83 transitions, 636 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:03,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:03,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:47:03,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:04,715 INFO L130 PetriNetUnfolder]: 670/1308 cut-off events. [2022-12-13 00:47:04,715 INFO L131 PetriNetUnfolder]: For 4311/4311 co-relation queries the response was YES. [2022-12-13 00:47:04,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5361 conditions, 1308 events. 670/1308 cut-off events. For 4311/4311 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7579 event pairs, 83 based on Foata normal form. 32/1177 useless extension candidates. Maximal degree in co-relation 5338. Up to 429 conditions per place. [2022-12-13 00:47:04,722 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 124 selfloop transitions, 67 changer transitions 13/209 dead transitions. [2022-12-13 00:47:04,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 209 transitions, 1866 flow [2022-12-13 00:47:04,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 00:47:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 00:47:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 203 transitions. [2022-12-13 00:47:04,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-13 00:47:04,724 INFO L175 Difference]: Start difference. First operand has 54 places, 83 transitions, 636 flow. Second operand 14 states and 203 transitions. [2022-12-13 00:47:04,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 209 transitions, 1866 flow [2022-12-13 00:47:04,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 209 transitions, 1813 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:04,734 INFO L231 Difference]: Finished difference. Result has 72 places, 130 transitions, 1236 flow [2022-12-13 00:47:04,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1236, PETRI_PLACES=72, PETRI_TRANSITIONS=130} [2022-12-13 00:47:04,736 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2022-12-13 00:47:04,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:04,736 INFO L89 Accepts]: Start accepts. Operand has 72 places, 130 transitions, 1236 flow [2022-12-13 00:47:04,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:04,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:04,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 130 transitions, 1236 flow [2022-12-13 00:47:04,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 130 transitions, 1236 flow [2022-12-13 00:47:04,789 INFO L130 PetriNetUnfolder]: 163/435 cut-off events. [2022-12-13 00:47:04,789 INFO L131 PetriNetUnfolder]: For 1516/1553 co-relation queries the response was YES. [2022-12-13 00:47:04,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 435 events. 163/435 cut-off events. For 1516/1553 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2689 event pairs, 9 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 2032. Up to 178 conditions per place. [2022-12-13 00:47:04,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 130 transitions, 1236 flow [2022-12-13 00:47:04,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 636 [2022-12-13 00:47:04,813 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:04,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 00:47:04,814 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 130 transitions, 1236 flow [2022-12-13 00:47:04,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:04,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:04,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:04,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:47:04,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash 745632934, now seen corresponding path program 2 times [2022-12-13 00:47:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:04,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775572967] [2022-12-13 00:47:04,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:05,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:05,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775572967] [2022-12-13 00:47:05,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775572967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:05,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528631470] [2022-12-13 00:47:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:05,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:05,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:05,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:05,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:47:05,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 130 transitions, 1236 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:05,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:05,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:47:05,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:06,052 INFO L130 PetriNetUnfolder]: 646/1251 cut-off events. [2022-12-13 00:47:06,052 INFO L131 PetriNetUnfolder]: For 5228/5228 co-relation queries the response was YES. [2022-12-13 00:47:06,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5932 conditions, 1251 events. 646/1251 cut-off events. For 5228/5228 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7195 event pairs, 56 based on Foata normal form. 12/1124 useless extension candidates. Maximal degree in co-relation 5901. Up to 927 conditions per place. [2022-12-13 00:47:06,061 INFO L137 encePairwiseOnDemand]: 17/30 looper letters, 96 selfloop transitions, 74 changer transitions 0/175 dead transitions. [2022-12-13 00:47:06,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 175 transitions, 1923 flow [2022-12-13 00:47:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-13 00:47:06,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-13 00:47:06,063 INFO L175 Difference]: Start difference. First operand has 72 places, 130 transitions, 1236 flow. Second operand 7 states and 92 transitions. [2022-12-13 00:47:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 175 transitions, 1923 flow [2022-12-13 00:47:06,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 175 transitions, 1813 flow, removed 39 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:06,077 INFO L231 Difference]: Finished difference. Result has 77 places, 155 transitions, 1645 flow [2022-12-13 00:47:06,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1645, PETRI_PLACES=77, PETRI_TRANSITIONS=155} [2022-12-13 00:47:06,078 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2022-12-13 00:47:06,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:06,078 INFO L89 Accepts]: Start accepts. Operand has 77 places, 155 transitions, 1645 flow [2022-12-13 00:47:06,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:06,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:06,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 155 transitions, 1645 flow [2022-12-13 00:47:06,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 155 transitions, 1645 flow [2022-12-13 00:47:06,144 INFO L130 PetriNetUnfolder]: 200/556 cut-off events. [2022-12-13 00:47:06,144 INFO L131 PetriNetUnfolder]: For 2194/2216 co-relation queries the response was YES. [2022-12-13 00:47:06,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2712 conditions, 556 events. 200/556 cut-off events. For 2194/2216 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3756 event pairs, 15 based on Foata normal form. 4/472 useless extension candidates. Maximal degree in co-relation 2683. Up to 188 conditions per place. [2022-12-13 00:47:06,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 155 transitions, 1645 flow [2022-12-13 00:47:06,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 00:47:06,149 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:06,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 00:47:06,150 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 155 transitions, 1645 flow [2022-12-13 00:47:06,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:06,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:06,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:06,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:47:06,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1228325244, now seen corresponding path program 3 times [2022-12-13 00:47:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:06,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713410233] [2022-12-13 00:47:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:06,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713410233] [2022-12-13 00:47:06,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713410233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:06,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:06,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347709953] [2022-12-13 00:47:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:06,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:06,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:06,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:47:06,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 155 transitions, 1645 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:06,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:06,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:47:06,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:07,276 INFO L130 PetriNetUnfolder]: 682/1320 cut-off events. [2022-12-13 00:47:07,277 INFO L131 PetriNetUnfolder]: For 6461/6461 co-relation queries the response was YES. [2022-12-13 00:47:07,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6767 conditions, 1320 events. 682/1320 cut-off events. For 6461/6461 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7699 event pairs, 68 based on Foata normal form. 16/1190 useless extension candidates. Maximal degree in co-relation 6735. Up to 1066 conditions per place. [2022-12-13 00:47:07,291 INFO L137 encePairwiseOnDemand]: 16/30 looper letters, 137 selfloop transitions, 57 changer transitions 0/199 dead transitions. [2022-12-13 00:47:07,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 199 transitions, 2415 flow [2022-12-13 00:47:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-13 00:47:07,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2022-12-13 00:47:07,293 INFO L175 Difference]: Start difference. First operand has 77 places, 155 transitions, 1645 flow. Second operand 7 states and 92 transitions. [2022-12-13 00:47:07,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 199 transitions, 2415 flow [2022-12-13 00:47:07,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 199 transitions, 2404 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:07,316 INFO L231 Difference]: Finished difference. Result has 82 places, 184 transitions, 2174 flow [2022-12-13 00:47:07,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2174, PETRI_PLACES=82, PETRI_TRANSITIONS=184} [2022-12-13 00:47:07,317 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2022-12-13 00:47:07,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:07,317 INFO L89 Accepts]: Start accepts. Operand has 82 places, 184 transitions, 2174 flow [2022-12-13 00:47:07,318 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:07,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:07,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 184 transitions, 2174 flow [2022-12-13 00:47:07,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 184 transitions, 2174 flow [2022-12-13 00:47:07,426 INFO L130 PetriNetUnfolder]: 219/594 cut-off events. [2022-12-13 00:47:07,427 INFO L131 PetriNetUnfolder]: For 3019/3026 co-relation queries the response was YES. [2022-12-13 00:47:07,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3282 conditions, 594 events. 219/594 cut-off events. For 3019/3026 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4063 event pairs, 9 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 3251. Up to 200 conditions per place. [2022-12-13 00:47:07,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 184 transitions, 2174 flow [2022-12-13 00:47:07,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-13 00:47:07,437 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:07,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 00:47:07,438 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 184 transitions, 2174 flow [2022-12-13 00:47:07,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:07,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:07,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:07,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:47:07,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash 576631142, now seen corresponding path program 1 times [2022-12-13 00:47:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:07,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42715604] [2022-12-13 00:47:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:07,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:08,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:08,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42715604] [2022-12-13 00:47:08,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42715604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:08,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:08,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601766509] [2022-12-13 00:47:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:08,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:08,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:47:08,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 184 transitions, 2174 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:08,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:08,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:47:08,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:08,605 INFO L130 PetriNetUnfolder]: 842/1670 cut-off events. [2022-12-13 00:47:08,605 INFO L131 PetriNetUnfolder]: For 12720/12720 co-relation queries the response was YES. [2022-12-13 00:47:08,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9173 conditions, 1670 events. 842/1670 cut-off events. For 12720/12720 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 10512 event pairs, 139 based on Foata normal form. 49/1517 useless extension candidates. Maximal degree in co-relation 9139. Up to 985 conditions per place. [2022-12-13 00:47:08,615 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 170 selfloop transitions, 26 changer transitions 60/261 dead transitions. [2022-12-13 00:47:08,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 261 transitions, 3513 flow [2022-12-13 00:47:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:47:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:47:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-13 00:47:08,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-13 00:47:08,616 INFO L175 Difference]: Start difference. First operand has 82 places, 184 transitions, 2174 flow. Second operand 6 states and 88 transitions. [2022-12-13 00:47:08,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 261 transitions, 3513 flow [2022-12-13 00:47:08,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 261 transitions, 3446 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:08,639 INFO L231 Difference]: Finished difference. Result has 86 places, 183 transitions, 2187 flow [2022-12-13 00:47:08,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2119, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2187, PETRI_PLACES=86, PETRI_TRANSITIONS=183} [2022-12-13 00:47:08,640 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2022-12-13 00:47:08,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:08,640 INFO L89 Accepts]: Start accepts. Operand has 86 places, 183 transitions, 2187 flow [2022-12-13 00:47:08,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:08,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:08,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 183 transitions, 2187 flow [2022-12-13 00:47:08,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 183 transitions, 2187 flow [2022-12-13 00:47:08,713 INFO L130 PetriNetUnfolder]: 198/566 cut-off events. [2022-12-13 00:47:08,714 INFO L131 PetriNetUnfolder]: For 3367/3385 co-relation queries the response was YES. [2022-12-13 00:47:08,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 566 events. 198/566 cut-off events. For 3367/3385 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3886 event pairs, 3 based on Foata normal form. 2/480 useless extension candidates. Maximal degree in co-relation 3080. Up to 177 conditions per place. [2022-12-13 00:47:08,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 183 transitions, 2187 flow [2022-12-13 00:47:08,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-13 00:47:08,721 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:08,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 00:47:08,722 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 183 transitions, 2187 flow [2022-12-13 00:47:08,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:08,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:08,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:08,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:47:08,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:08,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash 641275270, now seen corresponding path program 1 times [2022-12-13 00:47:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:08,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270239417] [2022-12-13 00:47:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270239417] [2022-12-13 00:47:09,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270239417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:09,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:09,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:47:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694339205] [2022-12-13 00:47:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:09,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:47:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:47:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:47:09,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-13 00:47:09,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 183 transitions, 2187 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:09,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:09,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-13 00:47:09,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:09,532 INFO L130 PetriNetUnfolder]: 623/1240 cut-off events. [2022-12-13 00:47:09,533 INFO L131 PetriNetUnfolder]: For 8834/8834 co-relation queries the response was YES. [2022-12-13 00:47:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6940 conditions, 1240 events. 623/1240 cut-off events. For 8834/8834 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7210 event pairs, 118 based on Foata normal form. 4/1104 useless extension candidates. Maximal degree in co-relation 6904. Up to 782 conditions per place. [2022-12-13 00:47:09,545 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 108 selfloop transitions, 81 changer transitions 5/199 dead transitions. [2022-12-13 00:47:09,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 199 transitions, 2671 flow [2022-12-13 00:47:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 00:47:09,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 00:47:09,546 INFO L175 Difference]: Start difference. First operand has 85 places, 183 transitions, 2187 flow. Second operand 5 states and 72 transitions. [2022-12-13 00:47:09,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 199 transitions, 2671 flow [2022-12-13 00:47:09,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 199 transitions, 2638 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:09,565 INFO L231 Difference]: Finished difference. Result has 88 places, 186 transitions, 2509 flow [2022-12-13 00:47:09,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2509, PETRI_PLACES=88, PETRI_TRANSITIONS=186} [2022-12-13 00:47:09,566 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2022-12-13 00:47:09,566 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:09,566 INFO L89 Accepts]: Start accepts. Operand has 88 places, 186 transitions, 2509 flow [2022-12-13 00:47:09,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:09,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:09,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 186 transitions, 2509 flow [2022-12-13 00:47:09,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 186 transitions, 2509 flow [2022-12-13 00:47:09,638 INFO L130 PetriNetUnfolder]: 195/556 cut-off events. [2022-12-13 00:47:09,639 INFO L131 PetriNetUnfolder]: For 4634/4648 co-relation queries the response was YES. [2022-12-13 00:47:09,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3361 conditions, 556 events. 195/556 cut-off events. For 4634/4648 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3780 event pairs, 3 based on Foata normal form. 4/476 useless extension candidates. Maximal degree in co-relation 3326. Up to 174 conditions per place. [2022-12-13 00:47:09,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 186 transitions, 2509 flow [2022-12-13 00:47:09,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-13 00:47:12,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:12,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3284 [2022-12-13 00:47:12,850 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 189 transitions, 2653 flow [2022-12-13 00:47:12,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:12,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:12,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:12,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:47:12,851 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:12,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1639781356, now seen corresponding path program 2 times [2022-12-13 00:47:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:12,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248427019] [2022-12-13 00:47:12,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248427019] [2022-12-13 00:47:13,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248427019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:13,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:13,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 00:47:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654908693] [2022-12-13 00:47:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:13,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 00:47:13,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 00:47:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 00:47:13,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-13 00:47:13,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 189 transitions, 2653 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:13,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:13,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-13 00:47:13,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:15,105 INFO L130 PetriNetUnfolder]: 776/1662 cut-off events. [2022-12-13 00:47:15,105 INFO L131 PetriNetUnfolder]: For 16132/16132 co-relation queries the response was YES. [2022-12-13 00:47:15,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9701 conditions, 1662 events. 776/1662 cut-off events. For 16132/16132 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11179 event pairs, 95 based on Foata normal form. 36/1474 useless extension candidates. Maximal degree in co-relation 9663. Up to 830 conditions per place. [2022-12-13 00:47:15,118 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 149 selfloop transitions, 72 changer transitions 38/264 dead transitions. [2022-12-13 00:47:15,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 264 transitions, 3845 flow [2022-12-13 00:47:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 00:47:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 00:47:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 186 transitions. [2022-12-13 00:47:15,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-13 00:47:15,128 INFO L175 Difference]: Start difference. First operand has 89 places, 189 transitions, 2653 flow. Second operand 15 states and 186 transitions. [2022-12-13 00:47:15,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 264 transitions, 3845 flow [2022-12-13 00:47:15,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 264 transitions, 3833 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:15,163 INFO L231 Difference]: Finished difference. Result has 105 places, 187 transitions, 2706 flow [2022-12-13 00:47:15,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2706, PETRI_PLACES=105, PETRI_TRANSITIONS=187} [2022-12-13 00:47:15,163 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 49 predicate places. [2022-12-13 00:47:15,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:15,163 INFO L89 Accepts]: Start accepts. Operand has 105 places, 187 transitions, 2706 flow [2022-12-13 00:47:15,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:15,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:15,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 187 transitions, 2706 flow [2022-12-13 00:47:15,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 187 transitions, 2706 flow [2022-12-13 00:47:15,259 INFO L130 PetriNetUnfolder]: 181/534 cut-off events. [2022-12-13 00:47:15,259 INFO L131 PetriNetUnfolder]: For 4852/4869 co-relation queries the response was YES. [2022-12-13 00:47:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 534 events. 181/534 cut-off events. For 4852/4869 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3612 event pairs, 3 based on Foata normal form. 4/457 useless extension candidates. Maximal degree in co-relation 3480. Up to 180 conditions per place. [2022-12-13 00:47:15,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 187 transitions, 2706 flow [2022-12-13 00:47:15,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 00:47:15,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:15,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:16,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:17,903 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:17,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2741 [2022-12-13 00:47:17,904 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 186 transitions, 2755 flow [2022-12-13 00:47:17,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:17,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:17,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:17,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:47:17,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash 615543266, now seen corresponding path program 3 times [2022-12-13 00:47:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:17,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708327698] [2022-12-13 00:47:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708327698] [2022-12-13 00:47:18,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708327698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:18,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:18,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:18,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758005470] [2022-12-13 00:47:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:18,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:18,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:18,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-13 00:47:18,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 186 transitions, 2755 flow. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:18,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:18,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-13 00:47:18,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:18,759 INFO L130 PetriNetUnfolder]: 723/1551 cut-off events. [2022-12-13 00:47:18,759 INFO L131 PetriNetUnfolder]: For 19243/19243 co-relation queries the response was YES. [2022-12-13 00:47:18,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9421 conditions, 1551 events. 723/1551 cut-off events. For 19243/19243 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10610 event pairs, 209 based on Foata normal form. 57/1399 useless extension candidates. Maximal degree in co-relation 9379. Up to 795 conditions per place. [2022-12-13 00:47:18,769 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 158 selfloop transitions, 54 changer transitions 21/238 dead transitions. [2022-12-13 00:47:18,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 238 transitions, 3745 flow [2022-12-13 00:47:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:47:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:47:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-13 00:47:18,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39768339768339767 [2022-12-13 00:47:18,770 INFO L175 Difference]: Start difference. First operand has 104 places, 186 transitions, 2755 flow. Second operand 7 states and 103 transitions. [2022-12-13 00:47:18,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 238 transitions, 3745 flow [2022-12-13 00:47:18,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 238 transitions, 3638 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:18,806 INFO L231 Difference]: Finished difference. Result has 109 places, 187 transitions, 2849 flow [2022-12-13 00:47:18,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2849, PETRI_PLACES=109, PETRI_TRANSITIONS=187} [2022-12-13 00:47:18,807 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 53 predicate places. [2022-12-13 00:47:18,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:18,807 INFO L89 Accepts]: Start accepts. Operand has 109 places, 187 transitions, 2849 flow [2022-12-13 00:47:18,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:18,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:18,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 187 transitions, 2849 flow [2022-12-13 00:47:18,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 187 transitions, 2849 flow [2022-12-13 00:47:18,890 INFO L130 PetriNetUnfolder]: 172/542 cut-off events. [2022-12-13 00:47:18,890 INFO L131 PetriNetUnfolder]: For 6042/6053 co-relation queries the response was YES. [2022-12-13 00:47:18,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 542 events. 172/542 cut-off events. For 6042/6053 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3852 event pairs, 3 based on Foata normal form. 4/457 useless extension candidates. Maximal degree in co-relation 3596. Up to 180 conditions per place. [2022-12-13 00:47:18,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 187 transitions, 2849 flow [2022-12-13 00:47:18,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 00:47:18,897 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:19,051 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:47:19,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-13 00:47:19,051 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 187 transitions, 2858 flow [2022-12-13 00:47:19,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:19,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:19,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:19,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:47:19,052 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:19,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1889928480, now seen corresponding path program 1 times [2022-12-13 00:47:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:19,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405470271] [2022-12-13 00:47:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:19,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405470271] [2022-12-13 00:47:19,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405470271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:19,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:19,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:47:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142570891] [2022-12-13 00:47:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:19,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:47:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:47:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:47:19,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-13 00:47:19,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 187 transitions, 2858 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:19,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:19,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-13 00:47:19,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:20,351 INFO L130 PetriNetUnfolder]: 783/1627 cut-off events. [2022-12-13 00:47:20,352 INFO L131 PetriNetUnfolder]: For 21113/21113 co-relation queries the response was YES. [2022-12-13 00:47:20,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10444 conditions, 1627 events. 783/1627 cut-off events. For 21113/21113 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 10874 event pairs, 126 based on Foata normal form. 36/1464 useless extension candidates. Maximal degree in co-relation 10400. Up to 955 conditions per place. [2022-12-13 00:47:20,387 INFO L137 encePairwiseOnDemand]: 19/36 looper letters, 183 selfloop transitions, 86 changer transitions 11/285 dead transitions. [2022-12-13 00:47:20,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 285 transitions, 4800 flow [2022-12-13 00:47:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:47:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:47:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2022-12-13 00:47:20,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 00:47:20,388 INFO L175 Difference]: Start difference. First operand has 108 places, 187 transitions, 2858 flow. Second operand 11 states and 162 transitions. [2022-12-13 00:47:20,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 285 transitions, 4800 flow [2022-12-13 00:47:20,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 285 transitions, 4671 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 00:47:20,425 INFO L231 Difference]: Finished difference. Result has 121 places, 242 transitions, 4145 flow [2022-12-13 00:47:20,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2772, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4145, PETRI_PLACES=121, PETRI_TRANSITIONS=242} [2022-12-13 00:47:20,426 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 65 predicate places. [2022-12-13 00:47:20,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:20,426 INFO L89 Accepts]: Start accepts. Operand has 121 places, 242 transitions, 4145 flow [2022-12-13 00:47:20,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:20,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:20,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 242 transitions, 4145 flow [2022-12-13 00:47:20,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 242 transitions, 4145 flow [2022-12-13 00:47:20,516 INFO L130 PetriNetUnfolder]: 212/664 cut-off events. [2022-12-13 00:47:20,516 INFO L131 PetriNetUnfolder]: For 8360/8375 co-relation queries the response was YES. [2022-12-13 00:47:20,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4868 conditions, 664 events. 212/664 cut-off events. For 8360/8375 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5000 event pairs, 2 based on Foata normal form. 6/563 useless extension candidates. Maximal degree in co-relation 4820. Up to 229 conditions per place. [2022-12-13 00:47:20,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 242 transitions, 4145 flow [2022-12-13 00:47:20,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-13 00:47:20,562 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [617] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_43| |v_P1Thread1of1ForFork0_~arg#1.offset_43|) (= v_~x$r_buff0_thd2~0_251 v_~x$r_buff1_thd2~0_201) (= v_~x$w_buff0~0_583 v_~x$w_buff1~0_554) (= v_~x$r_buff0_thd1~0_279 v_~x$r_buff1_thd1~0_281) (= v_~x$r_buff0_thd0~0_468 v_~x$r_buff1_thd0~0_468) (= v_~x~0_747 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_43| |v_P1Thread1of1ForFork0_#in~arg#1.base_43|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_P0Thread1of1ForFork1_~arg.offset_66 |v_P0Thread1of1ForFork1_#in~arg.offset_66|) (= v_~x$w_buff0_used~0_817 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$w_buff0_used~0_818 v_~x$w_buff1_used~0_782) (= v_~x$r_buff0_thd2~0_250 1) (= 2 v_~x$w_buff0~0_582) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_782 256) 0)) (not (= (mod v_~x$w_buff0_used~0_817 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= |v_P0Thread1of1ForFork1_#in~arg.base_66| v_P0Thread1of1ForFork1_~arg.base_66)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_583, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_468, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_43|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_279, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_66|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_66|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_43|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_818} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_582, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_468, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_279, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_43|, ~x$w_buff1~0=v_~x$w_buff1~0_554, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_201, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_782, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_281, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_66|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_250, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_468, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_43|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_817, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_43|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_66|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_66, ~x~0=v_~x~0_747} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} 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 00:47:23,329 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:23,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2904 [2022-12-13 00:47:23,330 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 244 transitions, 4297 flow [2022-12-13 00:47:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:23,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:23,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:47:23,331 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1675720271, now seen corresponding path program 1 times [2022-12-13 00:47:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289521560] [2022-12-13 00:47:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:24,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289521560] [2022-12-13 00:47:24,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289521560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:24,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:24,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:47:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401661783] [2022-12-13 00:47:24,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:24,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:47:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:47:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:47:24,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2022-12-13 00:47:24,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 244 transitions, 4297 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:24,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:24,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2022-12-13 00:47:24,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:24,691 INFO L130 PetriNetUnfolder]: 852/1815 cut-off events. [2022-12-13 00:47:24,692 INFO L131 PetriNetUnfolder]: For 25660/25660 co-relation queries the response was YES. [2022-12-13 00:47:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12396 conditions, 1815 events. 852/1815 cut-off events. For 25660/25660 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 12620 event pairs, 174 based on Foata normal form. 27/1612 useless extension candidates. Maximal degree in co-relation 12345. Up to 1096 conditions per place. [2022-12-13 00:47:24,705 INFO L137 encePairwiseOnDemand]: 23/42 looper letters, 222 selfloop transitions, 101 changer transitions 23/351 dead transitions. [2022-12-13 00:47:24,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 351 transitions, 6493 flow [2022-12-13 00:47:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 00:47:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 00:47:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2022-12-13 00:47:24,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35064935064935066 [2022-12-13 00:47:24,707 INFO L175 Difference]: Start difference. First operand has 122 places, 244 transitions, 4297 flow. Second operand 11 states and 162 transitions. [2022-12-13 00:47:24,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 351 transitions, 6493 flow [2022-12-13 00:47:24,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 351 transitions, 6370 flow, removed 52 selfloop flow, removed 2 redundant places. [2022-12-13 00:47:24,771 INFO L231 Difference]: Finished difference. Result has 133 places, 288 transitions, 5511 flow [2022-12-13 00:47:24,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4042, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5511, PETRI_PLACES=133, PETRI_TRANSITIONS=288} [2022-12-13 00:47:24,772 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 77 predicate places. [2022-12-13 00:47:24,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:24,772 INFO L89 Accepts]: Start accepts. Operand has 133 places, 288 transitions, 5511 flow [2022-12-13 00:47:24,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:24,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:24,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 288 transitions, 5511 flow [2022-12-13 00:47:24,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 288 transitions, 5511 flow [2022-12-13 00:47:24,894 INFO L130 PetriNetUnfolder]: 229/714 cut-off events. [2022-12-13 00:47:24,894 INFO L131 PetriNetUnfolder]: For 10476/10503 co-relation queries the response was YES. [2022-12-13 00:47:24,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 714 events. 229/714 cut-off events. For 10476/10503 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5499 event pairs, 1 based on Foata normal form. 3/611 useless extension candidates. Maximal degree in co-relation 5692. Up to 254 conditions per place. [2022-12-13 00:47:24,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 288 transitions, 5511 flow [2022-12-13 00:47:24,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-13 00:47:24,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [631] $Ultimate##0-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_889 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_290 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_891 256) 0))) (let ((.cse1 (and .cse0 (not .cse3))) (.cse2 (and .cse0 .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_631 (ite .cse1 v_~x$w_buff1~0_601 v_~x~0_818)) v_~x~0_817) (= v_~x$w_buff0~0_632 v_~x$w_buff1~0_601) (= v_~x$w_buff0_used~0_889 (ite .cse0 0 1)) (= 2 v_~x$w_buff0~0_631) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff0_used~0_891) v_~x$w_buff1_used~0_852) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= v_~x$r_buff0_thd0~0_529 v_~x$r_buff1_thd0~0_528) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_45| |v_P1Thread1of1ForFork0_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_261 v_~x$r_buff1_thd2~0_209) (= |v_P1Thread1of1ForFork0_~arg#1.base_45| |v_P1Thread1of1ForFork0_#in~arg#1.base_45|) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_290) v_~x$r_buff0_thd1~0_289) (= v_~x$r_buff0_thd2~0_260 1) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_852 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_289 256) 0)) .cse4)) 0 v_~x$r_buff0_thd1~0_290) v_~x$r_buff1_thd1~0_291) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_632, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_529, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_45|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_290, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_261, ~x~0=v_~x~0_818, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_891} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_631, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_529, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_289, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_45|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_601, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_852, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_209, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_291, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_528, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_889, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_45|, ~x~0=v_~x~0_817} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~x~0] [2022-12-13 00:47:27,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [631] $Ultimate##0-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_889 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_290 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_891 256) 0))) (let ((.cse1 (and .cse0 (not .cse3))) (.cse2 (and .cse0 .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_631 (ite .cse1 v_~x$w_buff1~0_601 v_~x~0_818)) v_~x~0_817) (= v_~x$w_buff0~0_632 v_~x$w_buff1~0_601) (= v_~x$w_buff0_used~0_889 (ite .cse0 0 1)) (= 2 v_~x$w_buff0~0_631) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff0_used~0_891) v_~x$w_buff1_used~0_852) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= v_~x$r_buff0_thd0~0_529 v_~x$r_buff1_thd0~0_528) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_45| |v_P1Thread1of1ForFork0_~arg#1.offset_45|) (= v_~x$r_buff0_thd2~0_261 v_~x$r_buff1_thd2~0_209) (= |v_P1Thread1of1ForFork0_~arg#1.base_45| |v_P1Thread1of1ForFork0_#in~arg#1.base_45|) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_290) v_~x$r_buff0_thd1~0_289) (= v_~x$r_buff0_thd2~0_260 1) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_852 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_289 256) 0)) .cse4)) 0 v_~x$r_buff0_thd1~0_290) v_~x$r_buff1_thd1~0_291) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_632, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_529, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_45|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_290, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_261, ~x~0=v_~x~0_818, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_891} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_631, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_529, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_289, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_45|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_45|, ~x$w_buff1~0=v_~x$w_buff1~0_601, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_852, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_209, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_291, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_260, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_528, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_889, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_45|, ~x~0=v_~x~0_817} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~x~0] [2022-12-13 00:47:27,604 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:47:27,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2832 [2022-12-13 00:47:27,604 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 287 transitions, 5574 flow [2022-12-13 00:47:27,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:27,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:27,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:27,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:47:27,605 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:27,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1207017466, now seen corresponding path program 1 times [2022-12-13 00:47:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:27,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021212393] [2022-12-13 00:47:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:28,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:28,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021212393] [2022-12-13 00:47:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021212393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:47:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25027606] [2022-12-13 00:47:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:47:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:47:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:47:28,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2022-12-13 00:47:28,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 287 transitions, 5574 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:28,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:28,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2022-12-13 00:47:28,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:29,635 INFO L130 PetriNetUnfolder]: 814/1755 cut-off events. [2022-12-13 00:47:29,635 INFO L131 PetriNetUnfolder]: For 28259/28259 co-relation queries the response was YES. [2022-12-13 00:47:29,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12720 conditions, 1755 events. 814/1755 cut-off events. For 28259/28259 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 12342 event pairs, 152 based on Foata normal form. 36/1581 useless extension candidates. Maximal degree in co-relation 12665. Up to 1129 conditions per place. [2022-12-13 00:47:29,648 INFO L137 encePairwiseOnDemand]: 25/41 looper letters, 211 selfloop transitions, 132 changer transitions 24/372 dead transitions. [2022-12-13 00:47:29,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 372 transitions, 7202 flow [2022-12-13 00:47:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 00:47:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 00:47:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 179 transitions. [2022-12-13 00:47:29,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33583489681050654 [2022-12-13 00:47:29,649 INFO L175 Difference]: Start difference. First operand has 133 places, 287 transitions, 5574 flow. Second operand 13 states and 179 transitions. [2022-12-13 00:47:29,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 372 transitions, 7202 flow [2022-12-13 00:47:29,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 372 transitions, 7062 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-13 00:47:29,716 INFO L231 Difference]: Finished difference. Result has 146 places, 314 transitions, 6271 flow [2022-12-13 00:47:29,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5320, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6271, PETRI_PLACES=146, PETRI_TRANSITIONS=314} [2022-12-13 00:47:29,717 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 90 predicate places. [2022-12-13 00:47:29,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:29,717 INFO L89 Accepts]: Start accepts. Operand has 146 places, 314 transitions, 6271 flow [2022-12-13 00:47:29,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:29,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:29,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 314 transitions, 6271 flow [2022-12-13 00:47:29,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 314 transitions, 6271 flow [2022-12-13 00:47:29,864 INFO L130 PetriNetUnfolder]: 236/766 cut-off events. [2022-12-13 00:47:29,864 INFO L131 PetriNetUnfolder]: For 12145/12150 co-relation queries the response was YES. [2022-12-13 00:47:29,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6285 conditions, 766 events. 236/766 cut-off events. For 12145/12150 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6113 event pairs, 1 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 6229. Up to 276 conditions per place. [2022-12-13 00:47:29,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 314 transitions, 6271 flow [2022-12-13 00:47:29,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 956 [2022-12-13 00:47:29,874 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:47:29,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 00:47:29,875 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 314 transitions, 6271 flow [2022-12-13 00:47:29,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:29,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:29,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:29,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 00:47:29,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1674913738, now seen corresponding path program 1 times [2022-12-13 00:47:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:29,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609229208] [2022-12-13 00:47:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:30,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609229208] [2022-12-13 00:47:30,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609229208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:30,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:30,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:47:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680653800] [2022-12-13 00:47:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:30,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:47:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:47:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:47:30,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-13 00:47:30,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 314 transitions, 6271 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:30,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:30,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-13 00:47:30,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:31,470 INFO L130 PetriNetUnfolder]: 1087/2380 cut-off events. [2022-12-13 00:47:31,470 INFO L131 PetriNetUnfolder]: For 41706/41706 co-relation queries the response was YES. [2022-12-13 00:47:31,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16503 conditions, 2380 events. 1087/2380 cut-off events. For 41706/41706 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17939 event pairs, 136 based on Foata normal form. 66/2083 useless extension candidates. Maximal degree in co-relation 16444. Up to 663 conditions per place. [2022-12-13 00:47:31,485 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 158 selfloop transitions, 119 changer transitions 137/418 dead transitions. [2022-12-13 00:47:31,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 418 transitions, 8273 flow [2022-12-13 00:47:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 00:47:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 00:47:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-12-13 00:47:31,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-13 00:47:31,487 INFO L175 Difference]: Start difference. First operand has 145 places, 314 transitions, 6271 flow. Second operand 13 states and 189 transitions. [2022-12-13 00:47:31,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 418 transitions, 8273 flow [2022-12-13 00:47:31,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 418 transitions, 8094 flow, removed 75 selfloop flow, removed 4 redundant places. [2022-12-13 00:47:31,587 INFO L231 Difference]: Finished difference. Result has 159 places, 229 transitions, 4814 flow [2022-12-13 00:47:31,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=6100, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4814, PETRI_PLACES=159, PETRI_TRANSITIONS=229} [2022-12-13 00:47:31,587 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 103 predicate places. [2022-12-13 00:47:31,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:31,587 INFO L89 Accepts]: Start accepts. Operand has 159 places, 229 transitions, 4814 flow [2022-12-13 00:47:31,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:31,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:31,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 229 transitions, 4814 flow [2022-12-13 00:47:31,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 229 transitions, 4814 flow [2022-12-13 00:47:31,680 INFO L130 PetriNetUnfolder]: 156/636 cut-off events. [2022-12-13 00:47:31,681 INFO L131 PetriNetUnfolder]: For 10947/10952 co-relation queries the response was YES. [2022-12-13 00:47:31,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4901 conditions, 636 events. 156/636 cut-off events. For 10947/10952 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 5380 event pairs, 4 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 4839. Up to 199 conditions per place. [2022-12-13 00:47:31,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 229 transitions, 4814 flow [2022-12-13 00:47:31,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 768 [2022-12-13 00:47:31,696 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:47:32,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:32,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:33,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:33,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:33,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:33,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L847-->L859: Formula: (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_181 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd2~0_68 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd2~0_73 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_81 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd2~0_55 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_50 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_75 256) 0)) .cse3)) (.cse2 (and .cse4 .cse10)) (.cse5 (and (not (= (mod v_~x$w_buff0_used~0_182 256) 0)) .cse11)) (.cse6 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse9 (and .cse7 .cse11)) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_82 256) 0))))) (and (= v_~y~0_70 (ite .cse0 v_~y$w_buff0~0_53 (ite .cse1 v_~y$w_buff1~0_48 v_~y~0_71))) (= v_~y$w_buff1_used~0_74 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_75)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_74 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_54 256) 0)))) 0 v_~y$r_buff1_thd2~0_50) v_~y$r_buff1_thd2~0_49) (= v_~y$r_buff0_thd2~0_54 (ite .cse2 0 v_~y$r_buff0_thd2~0_55)) (= (ite .cse5 v_~x$w_buff0~0_93 (ite .cse6 v_~x$w_buff1~0_90 v_~x~0_142)) v_~x~0_141) (= v_~x$r_buff1_thd2~0_67 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_72 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_174 256) 0)))) 0 v_~x$r_buff1_thd2~0_68)) (= (ite .cse9 0 v_~x$r_buff0_thd2~0_73) v_~x$r_buff0_thd2~0_72) (= v_~x$w_buff0_used~0_181 (ite .cse5 0 v_~x$w_buff0_used~0_182)) (= (ite (or .cse6 .cse9) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= v_~y$w_buff0_used~0_81 (ite .cse0 0 v_~y$w_buff0_used~0_82))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_182, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, ~y~0=v_~y~0_71, ~x~0=v_~x~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_93, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_90, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_48, ~y$w_buff0~0=v_~y$w_buff0~0_53, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_54, ~y~0=v_~y~0_70, ~x~0=v_~x~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_74} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:34,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [624] L804-->L831: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_333 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_364 256) 0))) (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_73| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|) (= v_~y$w_buff1_used~0_332 (ite .cse0 v_~y$w_buff0_used~0_366 (ite .cse1 v_~y$w_buff0_used~0_366 0))) (= (ite (= (mod v_~y$w_buff0_used~0_366 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|) (= v_~weak$$choice2~0_333 |v_P1Thread1of1ForFork0_#t~nondet6#1_38|) (= v_~__unbuffered_p1_EAX~0_187 1) (= 0 v_~y$flush_delayed~0_63) (= v_~y$w_buff0_used~0_364 (ite .cse0 1 0)) (= (ite .cse0 v_~y$r_buff0_thd2~0_209 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_207 256) 0))) (or (and (= (mod v_~y$w_buff1_used~0_332 256) 0) .cse2) .cse1 (and .cse2 (= (mod v_~y$r_buff0_thd2~0_209 256) 0)))) v_~y$r_buff0_thd2~0_209 0)) v_~y$r_buff1_thd2~0_176) (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_55) (= v_~y$w_buff0~0_242 1) (= v_~y$r_buff0_thd0~0_191 v_~y$r_buff1_thd0~0_200) (= v_~y~0_307 (ite .cse0 v_~y$mem_tmp~0_54 1)) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd2~0_207) (= v_~y$w_buff1~0_220 v_~y$w_buff0~0_244) (= v_~y~0_308 v_~y$mem_tmp~0_54) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_38| v_~weak$$choice0~0_241) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_73| 0)))) InVars {P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_366, ~y$w_buff0~0=v_~y$w_buff0~0_244, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_209, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_38|, ~y~0=v_~y~0_308} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_73|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_364, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_73|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_176, ~weak$$choice0~0=v_~weak$$choice0~0_241, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$mem_tmp~0=v_~y$mem_tmp~0_54, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_187, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$w_buff0~0=v_~y$w_buff0~0_242, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_207, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_63, ~y~0=v_~y~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_333, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_200, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_332} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:47:34,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [625] L804-->L786: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd1~0_282 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_865 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_284 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_829 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_866 256) 0))))) (and (= v_~y$w_buff0_used~0_370 1) (= v_~y$r_buff0_thd2~0_214 v_~y$r_buff1_thd2~0_180) (= v_~y$r_buff0_thd0~0_193 v_~y$r_buff1_thd0~0_202) (= v_~y$r_buff0_thd2~0_213 1) (= v_~y$w_buff0~0_248 1) (= (ite .cse0 v_~x$w_buff0~0_617 (ite .cse1 v_~x$w_buff1~0_587 v_~x~0_794)) v_~x~0_793) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_75| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_75|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_370 256) 0)) (not (= (mod v_~y$w_buff1_used~0_336 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_75|) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_829) v_~x$w_buff1_used~0_828) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_75| 0)) (= v_~x$r_buff0_thd1~0_281 (ite .cse2 0 v_~x$r_buff0_thd1~0_282)) (= v_~x$w_buff0_used~0_865 (ite .cse0 0 v_~x$w_buff0_used~0_866)) (= v_~x$r_buff1_thd1~0_283 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_281 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_828 256) 0)))) 0 v_~x$r_buff1_thd1~0_284)) (= v_~y$r_buff0_thd1~0_55 v_~y$r_buff1_thd1~0_57) (= v_~y$w_buff0_used~0_371 v_~y$w_buff1_used~0_336) (= v_~y$w_buff1~0_224 v_~y$w_buff0~0_249)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_617, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_282, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_193, ~y$w_buff0~0=v_~y$w_buff0~0_249, ~x$w_buff1~0=v_~x$w_buff1~0_587, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_214, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_829, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_284, ~x~0=v_~x~0_794, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_866} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_617, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_75|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_281, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~x$w_buff1~0=v_~x$w_buff1~0_587, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_828, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_283, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_75|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_180, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_57, ~y$w_buff1~0=v_~y$w_buff1~0_224, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_193, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_213, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_55, ~x~0=v_~x~0_793, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_202, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_336} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, ~y$w_buff0_used~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:47:35,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [649] L847-->L786: Formula: (let ((.cse20 (not (= (mod v_~x$r_buff0_thd2~0_289 256) 0)))) (let ((.cse11 (and .cse20 (not (= 0 (mod v_~x$w_buff0_used~0_1029 256)))))) (let ((.cse5 (ite .cse11 0 v_~x$w_buff0_used~0_1029))) (let ((.cse7 (not (= (mod .cse5 256) 0))) (.cse8 (not (= 0 (mod v_~x$r_buff1_thd2~0_230 256))))) (let ((.cse12 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_988 256) 0)))) (.cse3 (and .cse7 .cse20))) (let ((.cse13 (ite (or .cse12 .cse3) 0 v_~x$w_buff1_used~0_988))) (let ((.cse16 (not (= (mod v_~x$w_buff0_used~0_1027 256) 0))) (.cse9 (not (= (mod .cse13 256) 0))) (.cse17 (not (= (mod v_~x$r_buff1_thd1~0_358 256) 0))) (.cse18 (not (= (mod v_~x$r_buff0_thd1~0_359 256) 0))) (.cse19 (not (= (mod v_~y$r_buff0_thd2~0_250 256) 0))) (.cse14 (not (= (mod v_~y$w_buff0_used~0_479 256) 0))) (.cse15 (not (= (mod v_~y$r_buff1_thd2~0_207 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_436 256) 0)) .cse15)) (.cse0 (and .cse19 .cse14)) (.cse2 (and .cse19 (not (= (mod v_~y$w_buff0_used~0_480 256) 0)))) (.cse4 (and .cse7 .cse18)) (.cse10 (and .cse9 .cse17)) (.cse6 (and .cse18 .cse16))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_436) v_~y$w_buff1_used~0_435) (= (ite .cse2 v_~y$w_buff0~0_314 (ite .cse1 v_~y$w_buff1~0_279 v_~y~0_405)) v_~y~0_404) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_289) v_~x$r_buff0_thd2~0_288) (= v_~x$w_buff0_used~0_1027 (ite .cse4 0 .cse5)) (= v_~x$r_buff0_thd1~0_358 (ite .cse6 0 v_~x$r_buff0_thd1~0_359)) (= v_~y$r_buff0_thd2~0_249 (ite .cse0 0 v_~y$r_buff0_thd2~0_250)) (= v_~y$w_buff0_used~0_479 (ite .cse2 0 v_~y$w_buff0_used~0_480)) (= (ite (or (and .cse7 (not (= (mod v_~x$r_buff0_thd2~0_288 256) 0))) (and .cse8 .cse9)) 0 v_~x$r_buff1_thd2~0_230) v_~x$r_buff1_thd2~0_229) (= (ite .cse4 v_~x$w_buff0~0_726 (ite .cse10 v_~x$w_buff1~0_690 (ite .cse11 v_~x$w_buff0~0_726 (ite .cse12 v_~x$w_buff1~0_690 v_~x~0_953)))) v_~x~0_951) (= (ite (or .cse10 .cse6) 0 .cse13) v_~x$w_buff1_used~0_986) (= v_~y$r_buff1_thd2~0_206 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_249 256) 0)) .cse14) (and (not (= 0 (mod v_~y$w_buff1_used~0_435 256))) .cse15)) 0 v_~y$r_buff1_thd2~0_207)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_358 256) 0)) .cse16) (and .cse17 (not (= (mod v_~x$w_buff1_used~0_986 256) 0)))) 0 v_~x$r_buff1_thd1~0_358) v_~x$r_buff1_thd1~0_357)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_726, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_359, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_480, ~x$w_buff1~0=v_~x$w_buff1~0_690, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_988, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_230, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_358, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_289, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1029, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_207, ~y$w_buff1~0=v_~y$w_buff1~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_314, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_250, ~y~0=v_~y~0_405, ~x~0=v_~x~0_953, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_436} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_726, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_358, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_479, ~x$w_buff1~0=v_~x$w_buff1~0_690, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_986, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_229, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_288, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1027, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_206, ~y$w_buff1~0=v_~y$w_buff1~0_279, ~y$w_buff0~0=v_~y$w_buff0~0_314, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_249, ~y~0=v_~y~0_404, ~x~0=v_~x~0_951, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_435} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~x$r_buff0_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:36,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] $Ultimate##0-->L895: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_329 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_173 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd0~0_164 256) 0))) (.cse7 (not (= (mod v_~x$r_buff1_thd0~0_465 256) 0))) (.cse6 (not (= (mod v_~x$w_buff0_used~0_809 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd0~0_465 256) 0)))) (let ((.cse1 (and .cse6 .cse11)) (.cse2 (and .cse11 (not (= (mod v_~x$w_buff0_used~0_810 256) 0)))) (.cse5 (and .cse7 (not (= (mod v_~x$w_buff1_used~0_775 256) 0)))) (.cse0 (and .cse10 (not (= (mod v_~y$w_buff0_used~0_330 256) 0)))) (.cse9 (and (not (= (mod v_~y$w_buff1_used~0_298 256) 0)) .cse4)) (.cse8 (and .cse3 .cse10))) (and (= v_~y$w_buff0_used~0_329 (ite .cse0 0 v_~y$w_buff0_used~0_330)) (= v_~x$r_buff0_thd0~0_464 (ite .cse1 0 v_~x$r_buff0_thd0~0_465)) (= v_P0Thread1of1ForFork1_~arg.offset_62 |v_P0Thread1of1ForFork1_#in~arg.offset_62|) (= (ite .cse2 0 v_~x$w_buff0_used~0_810) v_~x$w_buff0_used~0_809) (= v_~y$r_buff1_thd0~0_172 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_163 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_297 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_173)) (= (ite (or .cse1 .cse5) 0 v_~x$w_buff1_used~0_775) v_~x$w_buff1_used~0_774) (= v_~x~0_739 (ite .cse2 v_~x$w_buff0~0_578 (ite .cse5 v_~x$w_buff1~0_550 1))) (= |v_P0Thread1of1ForFork1_#in~arg.base_62| v_P0Thread1of1ForFork1_~arg.base_62) (= v_~x$r_buff1_thd0~0_464 (ite (or (and .cse6 (not (= (mod v_~x$r_buff0_thd0~0_464 256) 0))) (and .cse7 (not (= (mod v_~x$w_buff1_used~0_774 256) 0)))) 0 v_~x$r_buff1_thd0~0_465)) (= v_~y$r_buff0_thd0~0_163 (ite .cse8 0 v_~y$r_buff0_thd0~0_164)) (= (ite .cse0 v_~y$w_buff0~0_224 (ite .cse9 v_~y$w_buff1~0_202 v_~y~0_273)) v_~y~0_272) (= (ite (or .cse9 .cse8) 0 v_~y$w_buff1_used~0_298) v_~y$w_buff1_used~0_297)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_578, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_465, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_330, ~x$w_buff1~0=v_~x$w_buff1~0_550, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_775, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_62|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_465, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_810, ~y$w_buff1~0=v_~y$w_buff1~0_202, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_62|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_164, ~y$w_buff0~0=v_~y$w_buff0~0_224, ~y~0=v_~y~0_273, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_173, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_298} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_578, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_464, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_329, ~x$w_buff1~0=v_~x$w_buff1~0_550, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_774, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_62|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_464, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_809, ~y$w_buff1~0=v_~y$w_buff1~0_202, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_62|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_224, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_62, ~y~0=v_~y~0_272, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_172, ~x~0=v_~x~0_739, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_297} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [532] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 00:47:36,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L815-->L831: Formula: (let ((.cse10 (= 0 (mod v_~y$r_buff1_thd2~0_56 256))) (.cse6 (= (mod v_~y$r_buff0_thd2~0_63 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse6 .cse10)) (.cse4 (and .cse6 (= (mod v_~y$w_buff1_used~0_89 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_98 256) 0))) (let ((.cse8 (or .cse3 .cse4 .cse12)) (.cse9 (and .cse7 (not .cse12)))) (let ((.cse0 (ite .cse8 v_~y~0_83 (ite .cse9 v_~y$w_buff0~0_64 v_~y$w_buff1~0_57))) (.cse1 (not (= (mod v_~weak$$choice2~0_114 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_97 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= v_~__unbuffered_p1_EAX~0_20 .cse0) (= v_~y$w_buff1_used~0_88 (ite .cse1 v_~y$w_buff1_used~0_89 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_89 0))) (= v_~y$w_buff0~0_64 v_~y$w_buff0~0_63) (= v_~y$r_buff0_thd2~0_62 (ite .cse1 v_~y$r_buff0_thd2~0_63 (ite (or (and .cse5 .cse6) .cse2 .cse3) v_~y$r_buff0_thd2~0_63 (ite (and .cse7 (not .cse2)) 0 v_~y$r_buff0_thd2~0_63)))) (= v_~weak$$choice2~0_114 |v_P1Thread1of1ForFork0_#t~nondet6#1_1|) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_1| v_~weak$$choice0~0_24) (= v_~y$w_buff0_used~0_97 (ite .cse1 v_~y$w_buff0_used~0_98 (ite .cse8 v_~y$w_buff0_used~0_98 (ite .cse9 0 v_~y$w_buff0_used~0_98)))) (= v_~y~0_82 (ite .cse1 v_~y$mem_tmp~0_18 .cse0)) (= (ite .cse1 v_~y$r_buff1_thd2~0_56 (ite (let ((.cse11 (= (mod v_~y$r_buff0_thd2~0_62 256) 0))) (or .cse2 (and .cse10 .cse11) (and .cse5 .cse11))) v_~y$r_buff1_thd2~0_56 0)) v_~y$r_buff1_thd2~0_55) (= v_~y$w_buff1~0_57 v_~y$w_buff1~0_56) (= v_~y~0_83 v_~y$mem_tmp~0_18)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_57, ~y$w_buff0~0=v_~y$w_buff0~0_64, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_1|, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, ~weak$$choice0~0=v_~weak$$choice0~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_63, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:36,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [617] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_43| |v_P1Thread1of1ForFork0_~arg#1.offset_43|) (= v_~x$r_buff0_thd2~0_251 v_~x$r_buff1_thd2~0_201) (= v_~x$w_buff0~0_583 v_~x$w_buff1~0_554) (= v_~x$r_buff0_thd1~0_279 v_~x$r_buff1_thd1~0_281) (= v_~x$r_buff0_thd0~0_468 v_~x$r_buff1_thd0~0_468) (= v_~x~0_747 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_43| |v_P1Thread1of1ForFork0_#in~arg#1.base_43|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_P0Thread1of1ForFork1_~arg.offset_66 |v_P0Thread1of1ForFork1_#in~arg.offset_66|) (= v_~x$w_buff0_used~0_817 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$w_buff0_used~0_818 v_~x$w_buff1_used~0_782) (= v_~x$r_buff0_thd2~0_250 1) (= 2 v_~x$w_buff0~0_582) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_782 256) 0)) (not (= (mod v_~x$w_buff0_used~0_817 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= |v_P0Thread1of1ForFork1_#in~arg.base_66| v_P0Thread1of1ForFork1_~arg.base_66)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_583, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_468, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_43|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_279, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_66|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_66|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_43|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_818} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_582, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_468, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_279, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_43|, ~x$w_buff1~0=v_~x$w_buff1~0_554, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_201, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_782, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_281, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_66|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_250, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_468, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_43|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_66, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_817, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_43|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_66|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_66, ~x~0=v_~x~0_747} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] [2022-12-13 00:47:37,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [632] $Ultimate##0-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_927 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_319 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_929 256) 0))) (let ((.cse1 (and .cse0 (not .cse3))) (.cse2 (and .cse0 .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_662 (ite .cse1 v_~x$w_buff1~0_628 1)) v_~x~0_853) (= v_~x$r_buff0_thd2~0_265 v_~x$r_buff1_thd2~0_211) (= v_~x$w_buff1_used~0_888 (ite (or .cse2 .cse1) 0 v_~x$w_buff0_used~0_929)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_47| |v_P1Thread1of1ForFork0_~arg#1.offset_47|) (= v_~x$w_buff0~0_663 v_~x$w_buff1~0_628) (= v_P0Thread1of1ForFork1_~arg.offset_68 |v_P0Thread1of1ForFork1_#in~arg.offset_68|) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_85|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_85| 0)) (= 2 v_~x$w_buff0~0_662) (= v_~x$r_buff0_thd1~0_318 (ite .cse2 0 v_~x$r_buff0_thd1~0_319)) (= v_~x$w_buff0_used~0_927 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_85| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_85|) (= v_~x$r_buff0_thd2~0_264 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_68| v_P0Thread1of1ForFork1_~arg.base_68) (= (ite (or (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_318 256) 0))) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_888 256) 0)))) 0 v_~x$r_buff0_thd1~0_319) v_~x$r_buff1_thd1~0_319) (= |v_P1Thread1of1ForFork0_~arg#1.base_47| |v_P1Thread1of1ForFork0_#in~arg#1.base_47|) (= v_~x$r_buff0_thd0~0_556 v_~x$r_buff1_thd0~0_554)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_663, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_556, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_319, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_68|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_68|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_47|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_929} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_662, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_556, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_85|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_318, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_47|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_47|, ~x$w_buff1~0=v_~x$w_buff1~0_628, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_888, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_211, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_319, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_85|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_68|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_554, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_927, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_47|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_68|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_68, ~x~0=v_~x~0_853} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] [2022-12-13 00:47:37,945 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] and [532] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 00:47:38,259 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 00:47:38,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6673 [2022-12-13 00:47:38,260 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 213 transitions, 4599 flow [2022-12-13 00:47:38,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:38,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:38,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:38,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 00:47:38,260 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 178069721, now seen corresponding path program 1 times [2022-12-13 00:47:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:38,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799755070] [2022-12-13 00:47:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:38,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799755070] [2022-12-13 00:47:38,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799755070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:38,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:38,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:47:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860608852] [2022-12-13 00:47:38,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:38,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:47:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:38,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:47:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:47:38,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:47:38,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 213 transitions, 4599 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:38,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:38,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:47:38,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:38,961 INFO L130 PetriNetUnfolder]: 651/1440 cut-off events. [2022-12-13 00:47:38,961 INFO L131 PetriNetUnfolder]: For 35119/35119 co-relation queries the response was YES. [2022-12-13 00:47:38,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10700 conditions, 1440 events. 651/1440 cut-off events. For 35119/35119 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 10168 event pairs, 346 based on Foata normal form. 36/1237 useless extension candidates. Maximal degree in co-relation 10635. Up to 1184 conditions per place. [2022-12-13 00:47:38,972 INFO L137 encePairwiseOnDemand]: 31/43 looper letters, 184 selfloop transitions, 7 changer transitions 29/224 dead transitions. [2022-12-13 00:47:38,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 224 transitions, 5108 flow [2022-12-13 00:47:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 00:47:38,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3674418604651163 [2022-12-13 00:47:38,975 INFO L175 Difference]: Start difference. First operand has 142 places, 213 transitions, 4599 flow. Second operand 5 states and 79 transitions. [2022-12-13 00:47:38,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 224 transitions, 5108 flow [2022-12-13 00:47:39,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 224 transitions, 4473 flow, removed 186 selfloop flow, removed 18 redundant places. [2022-12-13 00:47:39,052 INFO L231 Difference]: Finished difference. Result has 129 places, 192 transitions, 3538 flow [2022-12-13 00:47:39,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3972, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3538, PETRI_PLACES=129, PETRI_TRANSITIONS=192} [2022-12-13 00:47:39,052 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 73 predicate places. [2022-12-13 00:47:39,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:39,057 INFO L89 Accepts]: Start accepts. Operand has 129 places, 192 transitions, 3538 flow [2022-12-13 00:47:39,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:39,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:39,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 192 transitions, 3538 flow [2022-12-13 00:47:39,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 192 transitions, 3538 flow [2022-12-13 00:47:39,174 INFO L130 PetriNetUnfolder]: 129/502 cut-off events. [2022-12-13 00:47:39,174 INFO L131 PetriNetUnfolder]: For 6650/6655 co-relation queries the response was YES. [2022-12-13 00:47:39,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 502 events. 129/502 cut-off events. For 6650/6655 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3877 event pairs, 2 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 3447. Up to 136 conditions per place. [2022-12-13 00:47:39,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 192 transitions, 3538 flow [2022-12-13 00:47:39,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 00:47:39,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L884-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse29 (not (= (mod v_~x$r_buff0_thd0~0_479 256) 0)))) (let ((.cse17 (and (not (= (mod v_~x$w_buff0_used~0_831 256) 0)) .cse29))) (let ((.cse2 (ite .cse17 0 v_~x$w_buff0_used~0_831))) (let ((.cse24 (= (mod .cse2 256) 0))) (let ((.cse27 (not .cse24))) (let ((.cse28 (and .cse27 .cse29))) (let ((.cse5 (ite .cse28 0 v_~x$r_buff0_thd0~0_479)) (.cse26 (not (= (mod v_~x$r_buff1_thd0~0_478 256) 0)))) (let ((.cse18 (and (not (= (mod v_~x$w_buff1_used~0_794 256) 0)) .cse26)) (.cse7 (= (mod .cse5 256) 0))) (let ((.cse10 (not .cse7)) (.cse15 (ite (or .cse28 .cse18) 0 v_~x$w_buff1_used~0_794))) (let ((.cse25 (= (mod .cse15 256) 0)) (.cse4 (and .cse27 .cse10))) (let ((.cse20 (ite (or (and .cse26 (not .cse25)) .cse4) 0 v_~x$r_buff1_thd0~0_478))) (let ((.cse22 (= (mod .cse20 256) 0))) (let ((.cse16 (and .cse7 .cse25)) (.cse9 (and .cse7 .cse22))) (let ((.cse11 (not (= (mod v_~y$r_buff1_thd0~0_177 256) 0))) (.cse23 (not (= (mod v_~y$r_buff0_thd0~0_168 256) 0))) (.cse12 (not (= (mod v_~y$w_buff0_used~0_340 256) 0))) (.cse3 (or .cse16 .cse24 .cse9))) (let ((.cse0 (ite .cse3 v_~x$mem_tmp~0_235 (ite .cse4 v_~x$w_buff0~0_594 v_~x$w_buff1~0_564))) (.cse13 (and .cse23 .cse12)) (.cse19 (and .cse23 (not (= (mod v_~y$w_buff0_used~0_341 256) 0)))) (.cse14 (and .cse11 (not (= (mod v_~y$w_buff1_used~0_309 256) 0)))) (.cse1 (not (= (mod v_~weak$$choice2~0_321 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_829 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_792 256) 0))) (and (= v_~x$w_buff0~0_594 v_~x$w_buff0~0_593) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_148| 0) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_171 0) (= v_~__unbuffered_p0_EAX~0_175 1) (= v_~__unbuffered_p1_EAX~0_175 1) (= .cse0 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_155) (= v_~x$w_buff0_used~0_829 (ite .cse1 .cse2 (ite .cse3 .cse2 (ite .cse4 0 .cse2)))) (= v_~x$r_buff0_thd0~0_477 (ite .cse1 .cse5 (ite (or .cse6 (and .cse7 .cse8) .cse9) .cse5 (ite (and (not .cse6) .cse10) 0 .cse5)))) (= v_~y$r_buff1_thd0~0_176 (ite (or (and .cse11 (not (= (mod v_~y$w_buff1_used~0_308 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_167 256) 0)) .cse12)) 0 v_~y$r_buff1_thd0~0_177)) (= v_~y$w_buff1_used~0_308 (ite (or .cse13 .cse14) 0 v_~y$w_buff1_used~0_309)) (= v_~x$flush_delayed~0_260 0) (= (ite .cse1 .cse15 (ite (or .cse6 .cse16 .cse9) .cse15 0)) v_~x$w_buff1_used~0_792) (= (ite .cse17 v_~x$w_buff0~0_594 (ite .cse18 v_~x$w_buff1~0_564 v_~x~0_759)) v_~x$mem_tmp~0_235) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_132| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_148|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_132| (mod v_~main$tmp_guard1~0_155 256)) (= v_~x$w_buff1~0_564 v_~x$w_buff1~0_563) (= (ite .cse19 0 v_~y$w_buff0_used~0_341) v_~y$w_buff0_used~0_340) (= (ite .cse1 v_~x$mem_tmp~0_235 .cse0) v_~x~0_757) (= v_~y$r_buff0_thd0~0_167 (ite .cse13 0 v_~y$r_buff0_thd0~0_168)) (= v_~y~0_283 (ite .cse19 v_~y$w_buff0~0_230 (ite .cse14 v_~y$w_buff1~0_208 v_~y~0_284))) (= v_~weak$$choice0~0_229 |v_ULTIMATE.start_main_#t~nondet13#1_289|) (= v_~x$r_buff1_thd0~0_476 (ite .cse1 .cse20 (ite (let ((.cse21 (= (mod v_~x$r_buff0_thd0~0_477 256) 0))) (or (and .cse21 .cse22) .cse6 (and .cse21 .cse8))) .cse20 0))) (= |v_ULTIMATE.start_main_#t~nondet14#1_287| v_~weak$$choice2~0_321))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_594, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_479, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_171, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_341, ~x$w_buff1~0=v_~x$w_buff1~0_564, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_794, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_478, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_831, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_287|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_175, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_175, ~y$w_buff1~0=v_~y$w_buff1~0_208, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_168, ~y$w_buff0~0=v_~y$w_buff0~0_230, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_289|, ~y~0=v_~y~0_284, ~x~0=v_~x~0_759, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_309} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_593, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_148|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_340, ~x$flush_delayed~0=v_~x$flush_delayed~0_260, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_155, ~x$mem_tmp~0=v_~x$mem_tmp~0_235, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_175, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_175, ~y$w_buff0~0=v_~y$w_buff0~0_230, ~y~0=v_~y~0_283, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_477, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_171, ~x$w_buff1~0=v_~x$w_buff1~0_563, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_792, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_476, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_829, ~weak$$choice0~0=v_~weak$$choice0~0_229, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_132|, ~y$w_buff1~0=v_~y$w_buff1~0_208, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_321, ~x~0=v_~x~0_757, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_176, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_308} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet13#1, ~y~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:39,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [602] L895-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd0~0_216 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd0~0_218 256) 0))) (let ((.cse7 (not .cse6)) (.cse2 (and .cse6 (= (mod v_~x$w_buff1_used~0_427 256) 0))) (.cse3 (and .cse6 .cse8)) (.cse12 (= (mod v_~x$w_buff0_used~0_438 256) 0))) (let ((.cse10 (or .cse2 .cse3 .cse12)) (.cse11 (and (not .cse12) .cse7))) (let ((.cse1 (ite .cse10 v_~x~0_377 (ite .cse11 v_~x$w_buff0~0_280 v_~x$w_buff1~0_269))) (.cse5 (= (mod v_~x$w_buff1_used~0_426 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_437 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_194 256) 0)))) (and (= (ite .cse0 v_~x$mem_tmp~0_120 .cse1) v_~x~0_376) (= (ite .cse0 v_~x$w_buff1_used~0_427 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_427 0)) v_~x$w_buff1_used~0_426) (= (ite (= (ite (not (and (= 2 .cse1) (= v_~__unbuffered_p0_EAX~0_72 1) (= v_~__unbuffered_p1_EBX~0_76 0) (= v_~__unbuffered_p1_EAX~0_79 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= |v_ULTIMATE.start_main_#t~nondet14#1_117| v_~weak$$choice2~0_194) (= v_~x$w_buff0~0_280 v_~x$w_buff0~0_279) (= (ite .cse0 v_~x$r_buff0_thd0~0_218 (ite (or .cse3 (and .cse5 .cse6) .cse4) v_~x$r_buff0_thd0~0_218 (ite (and .cse7 (not .cse4)) 0 v_~x$r_buff0_thd0~0_218))) v_~x$r_buff0_thd0~0_217) (= v_~weak$$choice0~0_102 |v_ULTIMATE.start_main_#t~nondet13#1_119|) (= v_~x~0_377 v_~x$mem_tmp~0_120) (= v_~x$flush_delayed~0_145 0) (= v_~x$w_buff1~0_269 v_~x$w_buff1~0_268) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (= (ite .cse0 v_~x$r_buff1_thd0~0_216 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_217 256) 0))) (or (and .cse8 .cse9) (and .cse5 .cse9) .cse4)) v_~x$r_buff1_thd0~0_216 0)) v_~x$r_buff1_thd0~0_215) (= v_~x$w_buff0_used~0_437 (ite .cse0 v_~x$w_buff0_used~0_438 (ite .cse10 v_~x$w_buff0_used~0_438 (ite .cse11 0 v_~x$w_buff0_used~0_438)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_218, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~x$w_buff1~0=v_~x$w_buff1~0_269, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_119|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_427, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_216, ~x~0=v_~x~0_377, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_117|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_279, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~x$flush_delayed~0=v_~x$flush_delayed~0_145, ~x$w_buff1~0=v_~x$w_buff1~0_268, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_426, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~x$mem_tmp~0=v_~x$mem_tmp~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_437, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_194, ~x~0=v_~x~0_376} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet13#1, ~weak$$choice2~0, ~x~0] and [471] L779-->L786: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_38 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= v_~x$r_buff0_thd1~0_43 (ite .cse2 0 v_~x$r_buff0_thd1~0_44)) (= v_~x$r_buff1_thd1~0_37 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_106 256) 0)))) 0 v_~x$r_buff1_thd1~0_38)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_42 v_~x~0_76)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_38, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~x$w_buff1~0=v_~x$w_buff1~0_42, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} 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 00:47:40,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L831-->L847: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd2~0_76 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd2~0_81 256) 0))) (let ((.cse9 (not .cse8)) (.cse10 (and .cse8 (= (mod v_~x$w_buff1_used~0_213 256) 0))) (.cse7 (and .cse8 .cse2)) (.cse11 (= (mod v_~x$w_buff0_used~0_220 256) 0))) (let ((.cse5 (or .cse10 .cse7 .cse11)) (.cse6 (and (not .cse11) .cse9)) (.cse3 (= (mod v_~x$w_buff1_used~0_212 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_118 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_219 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_60 v_~__unbuffered_p1_EBX~0_18) v_~x~0_171) (= v_~x$w_buff1~0_113 v_~x$w_buff1~0_112) (= v_~x$mem_tmp~0_60 v_~x~0_173) (= v_~weak$$choice2~0_118 |v_P1Thread1of1ForFork0_#t~nondet8#1_1|) (= v_~x$flush_delayed~0_83 0) (= v_~x$r_buff1_thd2~0_75 (ite .cse0 v_~x$r_buff1_thd2~0_76 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_80 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~x$r_buff1_thd2~0_76 0))) (= |v_P1Thread1of1ForFork0_#t~nondet7#1_1| v_~weak$$choice0~0_28) (= (ite .cse0 v_~x$w_buff0_used~0_220 (ite .cse5 v_~x$w_buff0_used~0_220 (ite .cse6 0 v_~x$w_buff0_used~0_220))) v_~x$w_buff0_used~0_219) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse5 v_~x~0_173 (ite .cse6 v_~x$w_buff0~0_118 v_~x$w_buff1~0_113))) (= (ite .cse0 v_~x$r_buff0_thd2~0_81 (ite (or .cse7 .cse4 (and .cse3 .cse8)) v_~x$r_buff0_thd2~0_81 (ite (and (not .cse4) .cse9) 0 v_~x$r_buff0_thd2~0_81))) v_~x$r_buff0_thd2~0_80) (= v_~x$w_buff0~0_118 v_~x$w_buff0~0_117) (= v_~x$w_buff1_used~0_212 (ite .cse0 v_~x$w_buff1_used~0_213 (ite (or .cse10 .cse7 .cse4) v_~x$w_buff1_used~0_213 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_118, ~x$w_buff1~0=v_~x$w_buff1~0_113, P1Thread1of1ForFork0_#t~nondet7#1=|v_P1Thread1of1ForFork0_#t~nondet7#1_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_213, P1Thread1of1ForFork0_#t~nondet8#1=|v_P1Thread1of1ForFork0_#t~nondet8#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_81, ~x~0=v_~x~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_220} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_117, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~x$flush_delayed~0=v_~x$flush_delayed~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_219, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_118, ~x~0=v_~x~0_171} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet8#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork0_#t~nondet7#1, ~weak$$choice2~0, ~x~0] and [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 00:47:40,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] L831-->L847: Formula: (let ((.cse2 (= (mod v_~x$r_buff1_thd2~0_76 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd2~0_81 256) 0))) (let ((.cse9 (not .cse8)) (.cse10 (and .cse8 (= (mod v_~x$w_buff1_used~0_213 256) 0))) (.cse7 (and .cse8 .cse2)) (.cse11 (= (mod v_~x$w_buff0_used~0_220 256) 0))) (let ((.cse5 (or .cse10 .cse7 .cse11)) (.cse6 (and (not .cse11) .cse9)) (.cse3 (= (mod v_~x$w_buff1_used~0_212 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_118 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_219 256) 0))) (and (= (ite .cse0 v_~x$mem_tmp~0_60 v_~__unbuffered_p1_EBX~0_18) v_~x~0_171) (= v_~x$w_buff1~0_113 v_~x$w_buff1~0_112) (= v_~x$mem_tmp~0_60 v_~x~0_173) (= v_~weak$$choice2~0_118 |v_P1Thread1of1ForFork0_#t~nondet8#1_1|) (= v_~x$flush_delayed~0_83 0) (= v_~x$r_buff1_thd2~0_75 (ite .cse0 v_~x$r_buff1_thd2~0_76 (ite (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_80 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~x$r_buff1_thd2~0_76 0))) (= |v_P1Thread1of1ForFork0_#t~nondet7#1_1| v_~weak$$choice0~0_28) (= (ite .cse0 v_~x$w_buff0_used~0_220 (ite .cse5 v_~x$w_buff0_used~0_220 (ite .cse6 0 v_~x$w_buff0_used~0_220))) v_~x$w_buff0_used~0_219) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse5 v_~x~0_173 (ite .cse6 v_~x$w_buff0~0_118 v_~x$w_buff1~0_113))) (= (ite .cse0 v_~x$r_buff0_thd2~0_81 (ite (or .cse7 .cse4 (and .cse3 .cse8)) v_~x$r_buff0_thd2~0_81 (ite (and (not .cse4) .cse9) 0 v_~x$r_buff0_thd2~0_81))) v_~x$r_buff0_thd2~0_80) (= v_~x$w_buff0~0_118 v_~x$w_buff0~0_117) (= v_~x$w_buff1_used~0_212 (ite .cse0 v_~x$w_buff1_used~0_213 (ite (or .cse10 .cse7 .cse4) v_~x$w_buff1_used~0_213 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_118, ~x$w_buff1~0=v_~x$w_buff1~0_113, P1Thread1of1ForFork0_#t~nondet7#1=|v_P1Thread1of1ForFork0_#t~nondet7#1_1|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_76, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_213, P1Thread1of1ForFork0_#t~nondet8#1=|v_P1Thread1of1ForFork0_#t~nondet8#1_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_81, ~x~0=v_~x~0_173, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_220} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_117, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~x$flush_delayed~0=v_~x$flush_delayed~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_112, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$mem_tmp~0=v_~x$mem_tmp~0_60, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_219, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_118, ~x~0=v_~x~0_171} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p1_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet8#1, ~x$w_buff0_used~0, ~weak$$choice0~0, P1Thread1of1ForFork0_#t~nondet7#1, ~weak$$choice2~0, ~x~0] and [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-13 00:47:40,822 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:40,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1771 [2022-12-13 00:47:40,823 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 193 transitions, 3595 flow [2022-12-13 00:47:40,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:40,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:40,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:40,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 00:47:40,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:40,824 INFO L85 PathProgramCache]: Analyzing trace with hash -739268545, now seen corresponding path program 1 times [2022-12-13 00:47:40,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:40,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068227165] [2022-12-13 00:47:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:40,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:41,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068227165] [2022-12-13 00:47:41,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068227165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:41,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:41,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:47:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960153598] [2022-12-13 00:47:41,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:41,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:47:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:41,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:47:41,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:47:41,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 43 [2022-12-13 00:47:41,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 193 transitions, 3595 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:41,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:41,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 43 [2022-12-13 00:47:41,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:41,757 INFO L130 PetriNetUnfolder]: 572/1220 cut-off events. [2022-12-13 00:47:41,757 INFO L131 PetriNetUnfolder]: For 18092/18092 co-relation queries the response was YES. [2022-12-13 00:47:41,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8118 conditions, 1220 events. 572/1220 cut-off events. For 18092/18092 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8039 event pairs, 196 based on Foata normal form. 21/1051 useless extension candidates. Maximal degree in co-relation 8065. Up to 1051 conditions per place. [2022-12-13 00:47:41,766 INFO L137 encePairwiseOnDemand]: 27/43 looper letters, 177 selfloop transitions, 14 changer transitions 14/209 dead transitions. [2022-12-13 00:47:41,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 209 transitions, 4110 flow [2022-12-13 00:47:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:47:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:47:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-12-13 00:47:41,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2703488372093023 [2022-12-13 00:47:41,768 INFO L175 Difference]: Start difference. First operand has 125 places, 193 transitions, 3595 flow. Second operand 8 states and 93 transitions. [2022-12-13 00:47:41,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 209 transitions, 4110 flow [2022-12-13 00:47:41,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 209 transitions, 3959 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-13 00:47:41,807 INFO L231 Difference]: Finished difference. Result has 132 places, 191 transitions, 3422 flow [2022-12-13 00:47:41,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3396, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3422, PETRI_PLACES=132, PETRI_TRANSITIONS=191} [2022-12-13 00:47:41,807 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places. [2022-12-13 00:47:41,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:41,807 INFO L89 Accepts]: Start accepts. Operand has 132 places, 191 transitions, 3422 flow [2022-12-13 00:47:41,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:41,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:41,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 191 transitions, 3422 flow [2022-12-13 00:47:41,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 191 transitions, 3422 flow [2022-12-13 00:47:41,874 INFO L130 PetriNetUnfolder]: 128/475 cut-off events. [2022-12-13 00:47:41,874 INFO L131 PetriNetUnfolder]: For 6034/6039 co-relation queries the response was YES. [2022-12-13 00:47:41,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3333 conditions, 475 events. 128/475 cut-off events. For 6034/6039 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 3580 event pairs, 0 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 3281. Up to 131 conditions per place. [2022-12-13 00:47:41,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 191 transitions, 3422 flow [2022-12-13 00:47:41,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-13 00:47:42,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [662] L831-->L779: Formula: (let ((.cse23 (= (mod v_~x$r_buff1_thd2~0_250 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd2~0_317 256) 0))) (let ((.cse11 (not .cse9)) (.cse25 (= (mod v_~x$w_buff0_used~0_1103 256) 0)) (.cse7 (and .cse9 .cse23)) (.cse24 (and .cse9 (= (mod v_~x$w_buff1_used~0_1062 256) 0)))) (let ((.cse5 (not (= (mod |v_P1Thread1of1ForFork0_#t~nondet8#1_38| 256) 0))) (.cse20 (or .cse25 .cse7 .cse24)) (.cse21 (and .cse11 (not .cse25)))) (let ((.cse17 (ite .cse5 v_~x$w_buff0_used~0_1103 (ite .cse20 v_~x$w_buff0_used~0_1103 (ite .cse21 0 v_~x$w_buff0_used~0_1103))))) (let ((.cse6 (= (mod .cse17 256) 0))) (let ((.cse15 (ite .cse5 v_~x$w_buff1_used~0_1062 (ite (or .cse6 .cse7 .cse24) v_~x$w_buff1_used~0_1062 0)))) (let ((.cse8 (= (mod .cse15 256) 0)) (.cse4 (= (mod v_~x$r_buff1_thd1~0_408 256) 0)) (.cse13 (= (mod v_~x$r_buff0_thd1~0_411 256) 0))) (let ((.cse10 (not .cse6)) (.cse14 (not .cse13)) (.cse12 (and .cse13 .cse4)) (.cse16 (and .cse8 .cse13))) (let ((.cse1 (= (mod v_~x$w_buff1_used~0_1060 256) 0)) (.cse3 (= (mod v_~x$w_buff0_used~0_1101 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_393 256) 0))) (.cse18 (or .cse12 .cse16 .cse6)) (.cse19 (and .cse10 .cse14))) (and (= v_~x$r_buff1_thd1~0_407 (ite .cse0 v_~x$r_buff1_thd1~0_408 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd1~0_410 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~x$r_buff1_thd1~0_408 0))) (= v_~x$r_buff0_thd2~0_316 (ite .cse5 v_~x$r_buff0_thd2~0_317 (ite (or .cse6 .cse7 (and .cse8 .cse9)) v_~x$r_buff0_thd2~0_317 (ite (and .cse10 .cse11) 0 v_~x$r_buff0_thd2~0_317)))) (= (ite .cse0 v_~x$r_buff0_thd1~0_411 (ite (or .cse3 .cse12 (and .cse13 .cse1)) v_~x$r_buff0_thd1~0_411 (ite (and .cse14 (not .cse3)) 0 v_~x$r_buff0_thd1~0_411))) v_~x$r_buff0_thd1~0_410) (= (ite .cse0 .cse15 (ite (or .cse3 .cse12 .cse16) .cse15 0)) v_~x$w_buff1_used~0_1060) (= v_~x$w_buff0_used~0_1101 (ite .cse0 .cse17 (ite .cse18 .cse17 (ite .cse19 0 .cse17)))) (= v_~x~0_1019 (ite .cse0 v_~x$mem_tmp~0_299 v_~__unbuffered_p0_EAX~0_245)) (= v_~__unbuffered_p1_EBX~0_213 (ite .cse20 v_~x~0_1021 (ite .cse21 v_~x$w_buff0~0_774 v_~x$w_buff1~0_738))) (= (ite .cse18 v_~x$mem_tmp~0_299 (ite .cse19 v_~x$w_buff0~0_774 v_~x$w_buff1~0_736)) v_~__unbuffered_p0_EAX~0_245) (= v_~weak$$choice2~0_393 |v_P0Thread1of1ForFork1_#t~nondet4_106|) (= v_~x$flush_delayed~0_324 0) (= v_~x$w_buff1~0_738 v_~x$w_buff1~0_736) (= (ite .cse5 v_~x$r_buff1_thd2~0_250 (ite (let ((.cse22 (= (mod v_~x$r_buff0_thd2~0_316 256) 0))) (or .cse6 (and .cse8 .cse22) (and .cse23 .cse22))) v_~x$r_buff1_thd2~0_250 0)) v_~x$r_buff1_thd2~0_249) (= v_~weak$$choice0~0_301 |v_P0Thread1of1ForFork1_#t~nondet3_106|) (= (ite .cse5 v_~x~0_1021 v_~__unbuffered_p1_EBX~0_213) v_~x$mem_tmp~0_299) (= v_~x$w_buff0~0_774 v_~x$w_buff0~0_772))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_774, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_411, ~x$w_buff1~0=v_~x$w_buff1~0_738, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_1062, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_250, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_408, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_317, P1Thread1of1ForFork0_#t~nondet8#1=|v_P1Thread1of1ForFork0_#t~nondet8#1_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1103, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_106|, ~x~0=v_~x~0_1021, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_106|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_772, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_410, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_213, ~x$flush_delayed~0=v_~x$flush_delayed~0_324, ~x$w_buff1~0=v_~x$w_buff1~0_736, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_1060, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_249, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_407, ~x$mem_tmp~0=v_~x$mem_tmp~0_299, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_316, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1101, ~weak$$choice0~0=v_~weak$$choice0~0_301, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_245, P1Thread1of1ForFork0_#t~nondet7#1=|v_P1Thread1of1ForFork0_#t~nondet7#1_37|, ~weak$$choice2~0=v_~weak$$choice2~0_393, ~x~0=v_~x~0_1019} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p1_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet8#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P1Thread1of1ForFork0_#t~nondet7#1, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [648] L847-->L786: Formula: (let ((.cse20 (not (= (mod v_~x$r_buff0_thd2~0_285 256) 0)))) (let ((.cse6 (and .cse20 (not (= (mod v_~x$w_buff0_used~0_1023 256) 0))))) (let ((.cse1 (ite .cse6 0 v_~x$w_buff0_used~0_1023))) (let ((.cse15 (not (= (mod .cse1 256) 0))) (.cse14 (not (= (mod v_~x$r_buff1_thd2~0_226 256) 0)))) (let ((.cse7 (and (not (= (mod v_~x$w_buff1_used~0_982 256) 0)) .cse14)) (.cse12 (and .cse15 .cse20))) (let ((.cse11 (ite (or .cse7 .cse12) 0 v_~x$w_buff1_used~0_982))) (let ((.cse9 (not (= (mod v_~x$w_buff0_used~0_1021 256) 0))) (.cse13 (not (= (mod .cse11 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd1~0_354 256) 0))) (.cse18 (not (= (mod v_~x$r_buff0_thd1~0_355 256) 0))) (.cse16 (not (= (mod v_~y$r_buff1_thd2~0_203 256) 0))) (.cse19 (not (= (mod v_~y$r_buff0_thd2~0_246 256) 0))) (.cse17 (not (= (mod v_~y$w_buff0_used~0_475 256) 0)))) (let ((.cse2 (and .cse19 .cse17)) (.cse4 (and .cse16 (not (= (mod v_~y$w_buff1_used~0_432 256) 0)))) (.cse0 (and .cse18 .cse15)) (.cse5 (and .cse13 .cse8)) (.cse3 (and .cse19 (not (= (mod v_~y$w_buff0_used~0_476 256) 0)))) (.cse10 (and .cse9 .cse18))) (and (= v_~x$w_buff0_used~0_1021 (ite .cse0 0 .cse1)) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_246) v_~y$r_buff0_thd2~0_245) (= v_~y~0_400 (ite .cse3 v_~y$w_buff0~0_312 (ite .cse4 v_~y$w_buff1~0_277 v_~y~0_401))) (= (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_432) v_~y$w_buff1_used~0_431) (= (ite .cse0 v_~x$w_buff0~0_724 (ite .cse5 v_~x$w_buff1~0_688 (ite .cse6 v_~x$w_buff0~0_724 (ite .cse7 v_~x$w_buff1~0_688 v_~x~0_947)))) v_~x~0_945) (= v_~x$r_buff1_thd1~0_353 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_980 256) 0)) .cse8) (and (not (= (mod v_~x$r_buff0_thd1~0_354 256) 0)) .cse9)) 0 v_~x$r_buff1_thd1~0_354)) (= v_~x$w_buff1_used~0_980 (ite (or .cse5 .cse10) 0 .cse11)) (= v_~x$r_buff0_thd2~0_284 (ite .cse12 0 v_~x$r_buff0_thd2~0_285)) (= (ite (or (and .cse13 .cse14) (and .cse15 (not (= (mod v_~x$r_buff0_thd2~0_284 256) 0)))) 0 v_~x$r_buff1_thd2~0_226) v_~x$r_buff1_thd2~0_225) (= v_~y$w_buff0_used~0_475 (ite .cse3 0 v_~y$w_buff0_used~0_476)) (= v_~x$r_buff0_thd1~0_354 (ite .cse10 0 v_~x$r_buff0_thd1~0_355)) (= (ite (or (and .cse16 (not (= (mod v_~y$w_buff1_used~0_431 256) 0))) (and .cse17 (not (= (mod v_~y$r_buff0_thd2~0_245 256) 0)))) 0 v_~y$r_buff1_thd2~0_203) v_~y$r_buff1_thd2~0_202)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_724, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_355, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_476, ~x$w_buff1~0=v_~x$w_buff1~0_688, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_982, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_226, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_354, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_285, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1023, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_203, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$w_buff0~0=v_~y$w_buff0~0_312, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_246, ~y~0=v_~y~0_401, ~x~0=v_~x~0_947, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_432} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_724, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_475, ~x$w_buff1~0=v_~x$w_buff1~0_688, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_980, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_225, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_353, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_284, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1021, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_202, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$w_buff0~0=v_~y$w_buff0~0_312, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_245, ~y~0=v_~y~0_400, ~x~0=v_~x~0_945, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_431} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~x$r_buff0_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:44,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L763-->L779: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd1~0_70 256) 0)) (.cse5 (= (mod v_~x$r_buff0_thd1~0_80 256) 0))) (let ((.cse7 (not .cse5)) (.cse10 (and (= 0 (mod v_~x$w_buff1_used~0_199 256)) .cse5)) (.cse3 (and .cse8 .cse5)) (.cse11 (= (mod v_~x$w_buff0_used~0_204 256) 0))) (let ((.cse0 (or .cse10 .cse3 .cse11)) (.cse1 (and .cse7 (not .cse11))) (.cse4 (= (mod v_~x$w_buff1_used~0_198 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_112 256) 0))) (.cse6 (= (mod v_~x$w_buff0_used~0_203 256) 0))) (and (= v_~x$flush_delayed~0_75 0) (= (ite .cse0 v_~x~0_159 (ite .cse1 v_~x$w_buff0~0_104 v_~x$w_buff1~0_101)) v_~__unbuffered_p0_EAX~0_14) (= v_~x$w_buff0~0_104 v_~x$w_buff0~0_103) (= (ite .cse2 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_14) v_~x~0_157) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_112) (= v_~x$r_buff0_thd1~0_79 (ite .cse2 v_~x$r_buff0_thd1~0_80 (ite (or .cse3 (and .cse4 .cse5) .cse6) v_~x$r_buff0_thd1~0_80 (ite (and .cse7 (not .cse6)) 0 v_~x$r_buff0_thd1~0_80)))) (= (ite .cse2 v_~x$w_buff0_used~0_204 (ite .cse0 v_~x$w_buff0_used~0_204 (ite .cse1 0 v_~x$w_buff0_used~0_204))) v_~x$w_buff0_used~0_203) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd1~0_69 (ite .cse2 v_~x$r_buff1_thd1~0_70 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_79 256) 0))) (or (and .cse8 .cse9) .cse6 (and .cse4 .cse9))) v_~x$r_buff1_thd1~0_70 0))) (= v_~x$w_buff1_used~0_198 (ite .cse2 v_~x$w_buff1_used~0_199 (ite (or .cse10 .cse3 .cse6) v_~x$w_buff1_used~0_199 0))) (= v_~x$w_buff1~0_101 v_~x$w_buff1~0_100) (= v_~x$mem_tmp~0_56 v_~x~0_159))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_104, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_101, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_199, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_70, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~x~0=v_~x~0_159, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_204} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_103, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_79, ~x$flush_delayed~0=v_~x$flush_delayed~0_75, ~x$w_buff1~0=v_~x$w_buff1~0_100, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_198, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_69, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203, ~weak$$choice0~0=v_~weak$$choice0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] and [650] L847-->L786: Formula: (let ((.cse20 (not (= (mod v_~x$r_buff0_thd2~0_293 256) 0)))) (let ((.cse12 (and .cse20 (not (= (mod v_~x$w_buff0_used~0_1035 256) 0))))) (let ((.cse11 (ite .cse12 0 v_~x$w_buff0_used~0_1035))) (let ((.cse0 (not (= (mod .cse11 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_234 256) 0)))) (let ((.cse13 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_994 256) 0)))) (.cse17 (and .cse0 .cse20))) (let ((.cse9 (ite (or .cse13 .cse17) 0 v_~x$w_buff1_used~0_994))) (let ((.cse5 (not (= (mod v_~y$r_buff1_thd2~0_211 256) 0))) (.cse18 (not (= (mod v_~y$r_buff0_thd2~0_254 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_483 256) 0))) (.cse16 (not (= (mod v_~x$w_buff0_used~0_1033 256) 0))) (.cse1 (not (= (mod .cse9 256) 0))) (.cse15 (not (= (mod v_~x$r_buff1_thd1~0_362 256) 0))) (.cse19 (not (= (mod v_~x$r_buff0_thd1~0_363 256) 0)))) (let ((.cse10 (and .cse0 .cse19)) (.cse8 (and .cse1 .cse15)) (.cse7 (and .cse16 .cse19)) (.cse4 (and .cse18 .cse6)) (.cse14 (and (not (= (mod v_~y$w_buff0_used~0_484 256) 0)) .cse18)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_440 256) 0)) .cse5))) (and (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_292 256) 0)) .cse0) (and .cse1 .cse2)) 0 v_~x$r_buff1_thd2~0_234) v_~x$r_buff1_thd2~0_233) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_440) v_~y$w_buff1_used~0_439) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_439 256) 0))) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_253 256) 0)))) 0 v_~y$r_buff1_thd2~0_211) v_~y$r_buff1_thd2~0_210) (= v_~x$w_buff1_used~0_992 (ite (or .cse7 .cse8) 0 .cse9)) (= v_~x$w_buff0_used~0_1033 (ite .cse10 0 .cse11)) (= (ite .cse10 v_~x$w_buff0~0_728 (ite .cse8 v_~x$w_buff1~0_692 (ite .cse12 v_~x$w_buff0~0_728 (ite .cse13 v_~x$w_buff1~0_692 v_~x~0_959)))) v_~x~0_957) (= v_~y$w_buff0_used~0_483 (ite .cse14 0 v_~y$w_buff0_used~0_484)) (= v_~x$r_buff1_thd1~0_361 (ite (or (and .cse15 (not (= (mod v_~x$w_buff1_used~0_992 256) 0))) (and .cse16 (not (= (mod v_~x$r_buff0_thd1~0_362 256) 0)))) 0 v_~x$r_buff1_thd1~0_362)) (= v_~x$r_buff0_thd1~0_362 (ite .cse7 0 v_~x$r_buff0_thd1~0_363)) (= v_~y$r_buff0_thd2~0_253 (ite .cse4 0 v_~y$r_buff0_thd2~0_254)) (= v_~x$r_buff0_thd2~0_292 (ite .cse17 0 v_~x$r_buff0_thd2~0_293)) (= v_~y~0_408 (ite .cse14 v_~y$w_buff0~0_316 (ite .cse3 v_~y$w_buff1~0_281 v_~y~0_409)))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_728, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_363, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_484, ~x$w_buff1~0=v_~x$w_buff1~0_692, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_994, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_234, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_362, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_293, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1035, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_211, ~y$w_buff1~0=v_~y$w_buff1~0_281, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_254, ~y~0=v_~y~0_409, ~x~0=v_~x~0_959, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_440} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_728, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_483, ~x$w_buff1~0=v_~x$w_buff1~0_692, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_992, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_233, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_361, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_292, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1033, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, ~y$w_buff1~0=v_~y$w_buff1~0_281, ~y$w_buff0~0=v_~y$w_buff0~0_316, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_253, ~y~0=v_~y~0_408, ~x~0=v_~x~0_957, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~x$r_buff0_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:44,635 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:47:44,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2828 [2022-12-13 00:47:44,635 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 189 transitions, 3388 flow [2022-12-13 00:47:44,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:44,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:47:44,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:47:44,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 00:47:44,636 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-12-13 00:47:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:47:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash -250092393, now seen corresponding path program 2 times [2022-12-13 00:47:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:47:44,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490318902] [2022-12-13 00:47:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:47:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:47:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:47:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:47:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:47:44,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490318902] [2022-12-13 00:47:44,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490318902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:47:44,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:47:44,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:47:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113155919] [2022-12-13 00:47:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:47:44,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:47:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:47:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:47:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:47:44,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 39 [2022-12-13 00:47:44,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 189 transitions, 3388 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:47:44,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:47:44,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 39 [2022-12-13 00:47:44,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:47:45,346 INFO L130 PetriNetUnfolder]: 558/1232 cut-off events. [2022-12-13 00:47:45,346 INFO L131 PetriNetUnfolder]: For 20822/20822 co-relation queries the response was YES. [2022-12-13 00:47:45,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8159 conditions, 1232 events. 558/1232 cut-off events. For 20822/20822 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8333 event pairs, 124 based on Foata normal form. 60/1101 useless extension candidates. Maximal degree in co-relation 8104. Up to 501 conditions per place. [2022-12-13 00:47:45,354 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 132 selfloop transitions, 9 changer transitions 93/238 dead transitions. [2022-12-13 00:47:45,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 238 transitions, 4569 flow [2022-12-13 00:47:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:47:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:47:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-13 00:47:45,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4256410256410256 [2022-12-13 00:47:45,356 INFO L175 Difference]: Start difference. First operand has 127 places, 189 transitions, 3388 flow. Second operand 5 states and 83 transitions. [2022-12-13 00:47:45,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 238 transitions, 4569 flow [2022-12-13 00:47:45,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 238 transitions, 4424 flow, removed 59 selfloop flow, removed 9 redundant places. [2022-12-13 00:47:45,400 INFO L231 Difference]: Finished difference. Result has 124 places, 128 transitions, 2039 flow [2022-12-13 00:47:45,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2039, PETRI_PLACES=124, PETRI_TRANSITIONS=128} [2022-12-13 00:47:45,400 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 68 predicate places. [2022-12-13 00:47:45,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:47:45,401 INFO L89 Accepts]: Start accepts. Operand has 124 places, 128 transitions, 2039 flow [2022-12-13 00:47:45,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:47:45,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:47:45,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 128 transitions, 2039 flow [2022-12-13 00:47:45,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 128 transitions, 2039 flow [2022-12-13 00:47:45,442 INFO L130 PetriNetUnfolder]: 77/293 cut-off events. [2022-12-13 00:47:45,443 INFO L131 PetriNetUnfolder]: For 3202/3202 co-relation queries the response was YES. [2022-12-13 00:47:45,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 293 events. 77/293 cut-off events. For 3202/3202 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1882 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 1962. Up to 87 conditions per place. [2022-12-13 00:47:45,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 128 transitions, 2039 flow [2022-12-13 00:47:45,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-13 00:47:45,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:45,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L804: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_260 256) 0)) (not (= (mod v_~x$w_buff0_used~0_273 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21| 0)) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_144) (= v_~x$w_buff0_used~0_273 1) (= v_~x$r_buff1_thd0~0_97 v_~x$r_buff0_thd0~0_97) (= v_~x$w_buff0_used~0_274 v_~x$w_buff1_used~0_260) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_104 1) (= 2 v_~x$w_buff0~0_155) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_105) (= v_~x$r_buff1_thd1~0_98 v_~x$r_buff0_thd1~0_107)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_105, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_274} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_97, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_21|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_144, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_260, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_98, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_97, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_273, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [545] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:47:46,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [480] L815-->L831: Formula: (let ((.cse10 (= 0 (mod v_~y$r_buff1_thd2~0_56 256))) (.cse6 (= (mod v_~y$r_buff0_thd2~0_63 256) 0))) (let ((.cse7 (not .cse6)) (.cse3 (and .cse6 .cse10)) (.cse4 (and .cse6 (= (mod v_~y$w_buff1_used~0_89 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_98 256) 0))) (let ((.cse8 (or .cse3 .cse4 .cse12)) (.cse9 (and .cse7 (not .cse12)))) (let ((.cse0 (ite .cse8 v_~y~0_83 (ite .cse9 v_~y$w_buff0~0_64 v_~y$w_buff1~0_57))) (.cse1 (not (= (mod v_~weak$$choice2~0_114 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_97 256) 0)) (.cse5 (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (= 0 v_~y$flush_delayed~0_25) (= v_~__unbuffered_p1_EAX~0_20 .cse0) (= v_~y$w_buff1_used~0_88 (ite .cse1 v_~y$w_buff1_used~0_89 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_89 0))) (= v_~y$w_buff0~0_64 v_~y$w_buff0~0_63) (= v_~y$r_buff0_thd2~0_62 (ite .cse1 v_~y$r_buff0_thd2~0_63 (ite (or (and .cse5 .cse6) .cse2 .cse3) v_~y$r_buff0_thd2~0_63 (ite (and .cse7 (not .cse2)) 0 v_~y$r_buff0_thd2~0_63)))) (= v_~weak$$choice2~0_114 |v_P1Thread1of1ForFork0_#t~nondet6#1_1|) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_1| v_~weak$$choice0~0_24) (= v_~y$w_buff0_used~0_97 (ite .cse1 v_~y$w_buff0_used~0_98 (ite .cse8 v_~y$w_buff0_used~0_98 (ite .cse9 0 v_~y$w_buff0_used~0_98)))) (= v_~y~0_82 (ite .cse1 v_~y$mem_tmp~0_18 .cse0)) (= (ite .cse1 v_~y$r_buff1_thd2~0_56 (ite (let ((.cse11 (= (mod v_~y$r_buff0_thd2~0_62 256) 0))) (or .cse2 (and .cse10 .cse11) (and .cse5 .cse11))) v_~y$r_buff1_thd2~0_56 0)) v_~y$r_buff1_thd2~0_55) (= v_~y$w_buff1~0_57 v_~y$w_buff1~0_56) (= v_~y~0_83 v_~y$mem_tmp~0_18)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_57, ~y$w_buff0~0=v_~y$w_buff0~0_64, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_1|, ~y~0=v_~y~0_83, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, ~weak$$choice0~0=v_~weak$$choice0~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_63, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~y~0=v_~y~0_82, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~nondet5#1, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 00:47:46,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} 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 00:47:46,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [469] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_207 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_84 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_74 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_208 256) 0)) .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_107 (ite .cse1 v_~x$w_buff1~0_104 v_~x~0_164)) v_~x~0_163) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_203) v_~x$w_buff1_used~0_202) (= v_~x$r_buff0_thd1~0_83 (ite .cse2 0 v_~x$r_buff0_thd1~0_84)) (= (ite .cse0 0 v_~x$w_buff0_used~0_208) v_~x$w_buff0_used~0_207) (= v_~x$r_buff1_thd1~0_73 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_83 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_202 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_74))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_84, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_74, ~x~0=v_~x~0_164, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_208} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$w_buff1~0=v_~x$w_buff1~0_104, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x~0=v_~x~0_163, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_207} 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 00:47:47,334 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L831-->L786: Formula: (let ((.cse42 (= 0 (mod v_~x$r_buff1_thd2~0_259 256))) (.cse48 (= (mod v_~x$r_buff0_thd2~0_326 256) 0))) (let ((.cse49 (not .cse48)) (.cse47 (and .cse42 .cse48)) (.cse53 (= (mod v_~x$w_buff0_used~0_1115 256) 0)) (.cse52 (and (= (mod v_~x$w_buff1_used~0_1074 256) 0) .cse48))) (let ((.cse21 (not (= (mod |v_P1Thread1of1ForFork0_#t~nondet8#1_46| 256) 0))) (.cse19 (or .cse47 .cse53 .cse52)) (.cse20 (and .cse49 (not .cse53)))) (let ((.cse51 (ite .cse21 v_~x$w_buff0_used~0_1115 (ite .cse19 v_~x$w_buff0_used~0_1115 (ite .cse20 0 v_~x$w_buff0_used~0_1115))))) (let ((.cse43 (= (mod .cse51 256) 0))) (let ((.cse45 (ite .cse21 v_~x$w_buff1_used~0_1074 (ite (or .cse47 .cse52 .cse43) v_~x$w_buff1_used~0_1074 0)))) (let ((.cse40 (= (mod .cse45 256) 0)) (.cse32 (= (mod v_~x$r_buff1_thd1~0_417 256) 0)) (.cse37 (= (mod v_~x$r_buff0_thd1~0_420 256) 0))) (let ((.cse50 (not .cse43)) (.cse39 (not .cse37)) (.cse36 (and .cse32 .cse37)) (.cse46 (and .cse40 .cse37))) (let ((.cse13 (not (= (mod v_~weak$$choice2~0_401 256) 0))) (.cse4 (or .cse36 .cse46 .cse43)) (.cse5 (and .cse50 .cse39))) (let ((.cse44 (ite .cse13 .cse51 (ite .cse4 .cse51 (ite .cse5 0 .cse51)))) (.cse7 (ite .cse21 v_~x$r_buff0_thd2~0_326 (ite (or .cse47 (and .cse40 .cse48) .cse43) v_~x$r_buff0_thd2~0_326 (ite (and .cse49 .cse50) 0 v_~x$r_buff0_thd2~0_326))))) (let ((.cse41 (= (mod .cse7 256) 0)) (.cse34 (= (mod .cse44 256) 0))) (let ((.cse38 (not .cse34)) (.cse35 (not .cse41))) (let ((.cse31 (ite .cse13 .cse45 (ite (or .cse36 .cse46 .cse34) .cse45 0))) (.cse11 (and .cse38 .cse35))) (let ((.cse3 (ite .cse11 0 .cse44)) (.cse18 (ite .cse21 v_~x$r_buff1_thd2~0_259 (ite (or (and .cse40 .cse41) (and .cse42 .cse41) .cse43) v_~x$r_buff1_thd2~0_259 0))) (.cse33 (= (mod .cse31 256) 0))) (let ((.cse9 (ite .cse13 v_~x$r_buff0_thd1~0_420 (ite (or .cse36 (and .cse33 .cse37) .cse34) v_~x$r_buff0_thd1~0_420 (ite (and .cse38 .cse39) 0 v_~x$r_buff0_thd1~0_420)))) (.cse15 (not (= (mod .cse18 256) 0))) (.cse17 (not (= (mod .cse3 256) 0)))) (let ((.cse6 (and .cse35 .cse17)) (.cse12 (and .cse15 (not .cse33))) (.cse30 (= (mod .cse9 256) 0))) (let ((.cse24 (ite .cse13 v_~x$r_buff1_thd1~0_417 (ite (or (and .cse30 .cse32) (and .cse30 .cse33) .cse34) v_~x$r_buff1_thd1~0_417 0))) (.cse27 (ite (or .cse6 .cse12) 0 .cse31))) (let ((.cse16 (not (= (mod .cse27 256) 0))) (.cse22 (not (= (mod .cse24 256) 0))) (.cse23 (not (= (mod v_~x$w_buff0_used~0_1113 256) 0))) (.cse25 (not (= (mod v_~y$w_buff0_used~0_527 256) 0))) (.cse26 (not (= (mod v_~y$r_buff1_thd2~0_229 256) 0))) (.cse28 (not .cse30)) (.cse29 (not (= (mod v_~y$r_buff0_thd2~0_278 256) 0)))) (let ((.cse0 (and .cse29 (not (= (mod v_~y$w_buff0_used~0_528 256) 0)))) (.cse2 (and .cse28 .cse17)) (.cse1 (and .cse26 (not (= (mod v_~y$w_buff1_used~0_478 256) 0)))) (.cse14 (and .cse25 .cse29)) (.cse8 (and .cse28 .cse23)) (.cse10 (and .cse16 .cse22))) (and (= v_~y~0_444 (ite .cse0 v_~y$w_buff0~0_346 (ite .cse1 v_~y$w_buff1~0_305 v_~y~0_445))) (= v_~x$w_buff0_used~0_1113 (ite .cse2 0 .cse3)) (= (ite .cse4 v_~x$mem_tmp~0_307 (ite .cse5 v_~x$w_buff0~0_785 v_~x$w_buff1~0_748)) v_~__unbuffered_p0_EAX~0_249) (= (ite .cse0 0 v_~y$w_buff0_used~0_528) v_~y$w_buff0_used~0_527) (= (ite .cse6 0 .cse7) v_~x$r_buff0_thd2~0_324) (= v_~weak$$choice0~0_309 |v_P0Thread1of1ForFork1_#t~nondet3_114|) (= (ite .cse8 0 .cse9) v_~x$r_buff0_thd1~0_418) (= (ite .cse2 v_~x$w_buff0~0_784 (ite .cse10 v_~x$w_buff1~0_748 (ite .cse11 v_~x$w_buff0~0_784 (ite .cse12 v_~x$w_buff1~0_748 (ite .cse13 v_~x$mem_tmp~0_307 v_~__unbuffered_p0_EAX~0_249))))) v_~x~0_1031) (= (ite (or .cse1 .cse14) 0 v_~y$w_buff1_used~0_478) v_~y$w_buff1_used~0_477) (= (ite (or (and .cse15 .cse16) (and (not (= (mod v_~x$r_buff0_thd2~0_324 256) 0)) .cse17)) 0 .cse18) v_~x$r_buff1_thd2~0_257) (= (ite .cse19 v_~x~0_1033 (ite .cse20 v_~x$w_buff0~0_785 v_~x$w_buff1~0_749)) v_~__unbuffered_p1_EBX~0_217) (= v_~weak$$choice2~0_401 |v_P0Thread1of1ForFork1_#t~nondet4_114|) (= (ite .cse14 0 v_~y$r_buff0_thd2~0_278) v_~y$r_buff0_thd2~0_277) (= (ite .cse21 v_~x~0_1033 v_~__unbuffered_p1_EBX~0_217) v_~x$mem_tmp~0_307) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_1072 256) 0)) .cse22) (and .cse23 (not (= (mod v_~x$r_buff0_thd1~0_418 256) 0)))) 0 .cse24) v_~x$r_buff1_thd1~0_415) (= v_~y$r_buff1_thd2~0_228 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_277 256) 0)) .cse25) (and .cse26 (not (= (mod v_~y$w_buff1_used~0_477 256) 0)))) 0 v_~y$r_buff1_thd2~0_229)) (= v_~x$w_buff1~0_749 v_~x$w_buff1~0_748) (= v_~x$w_buff0~0_785 v_~x$w_buff0~0_784) (= (ite (or .cse8 .cse10) 0 .cse27) v_~x$w_buff1_used~0_1072) (= v_~x$flush_delayed~0_332 0))))))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_785, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_420, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_528, ~x$w_buff1~0=v_~x$w_buff1~0_749, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_1074, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_259, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_417, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_326, P1Thread1of1ForFork0_#t~nondet8#1=|v_P1Thread1of1ForFork0_#t~nondet8#1_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1115, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_229, ~y$w_buff1~0=v_~y$w_buff1~0_305, ~y$w_buff0~0=v_~y$w_buff0~0_346, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_278, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_114|, ~y~0=v_~y~0_445, ~x~0=v_~x~0_1033, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_114|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_478} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_784, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_418, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_527, ~x$flush_delayed~0=v_~x$flush_delayed~0_332, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_415, ~x$mem_tmp~0=v_~x$mem_tmp~0_307, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_249, ~y$w_buff0~0=v_~y$w_buff0~0_346, P1Thread1of1ForFork0_#t~nondet7#1=|v_P1Thread1of1ForFork0_#t~nondet7#1_45|, ~y~0=v_~y~0_444, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_217, ~x$w_buff1~0=v_~x$w_buff1~0_748, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_1072, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_257, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_324, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1113, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_228, ~weak$$choice0~0=v_~weak$$choice0~0_309, ~y$w_buff1~0=v_~y$w_buff1~0_305, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_401, ~x~0=v_~x~0_1031, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_477} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet8#1, ~x$w_buff0_used~0, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~nondet7#1, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [602] L895-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~x$r_buff1_thd0~0_216 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd0~0_218 256) 0))) (let ((.cse7 (not .cse6)) (.cse2 (and .cse6 (= (mod v_~x$w_buff1_used~0_427 256) 0))) (.cse3 (and .cse6 .cse8)) (.cse12 (= (mod v_~x$w_buff0_used~0_438 256) 0))) (let ((.cse10 (or .cse2 .cse3 .cse12)) (.cse11 (and (not .cse12) .cse7))) (let ((.cse1 (ite .cse10 v_~x~0_377 (ite .cse11 v_~x$w_buff0~0_280 v_~x$w_buff1~0_269))) (.cse5 (= (mod v_~x$w_buff1_used~0_426 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_437 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_194 256) 0)))) (and (= (ite .cse0 v_~x$mem_tmp~0_120 .cse1) v_~x~0_376) (= (ite .cse0 v_~x$w_buff1_used~0_427 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_427 0)) v_~x$w_buff1_used~0_426) (= (ite (= (ite (not (and (= 2 .cse1) (= v_~__unbuffered_p0_EAX~0_72 1) (= v_~__unbuffered_p1_EBX~0_76 0) (= v_~__unbuffered_p1_EAX~0_79 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= |v_ULTIMATE.start_main_#t~nondet14#1_117| v_~weak$$choice2~0_194) (= v_~x$w_buff0~0_280 v_~x$w_buff0~0_279) (= (ite .cse0 v_~x$r_buff0_thd0~0_218 (ite (or .cse3 (and .cse5 .cse6) .cse4) v_~x$r_buff0_thd0~0_218 (ite (and .cse7 (not .cse4)) 0 v_~x$r_buff0_thd0~0_218))) v_~x$r_buff0_thd0~0_217) (= v_~weak$$choice0~0_102 |v_ULTIMATE.start_main_#t~nondet13#1_119|) (= v_~x~0_377 v_~x$mem_tmp~0_120) (= v_~x$flush_delayed~0_145 0) (= v_~x$w_buff1~0_269 v_~x$w_buff1~0_268) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (= (ite .cse0 v_~x$r_buff1_thd0~0_216 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd0~0_217 256) 0))) (or (and .cse8 .cse9) (and .cse5 .cse9) .cse4)) v_~x$r_buff1_thd0~0_216 0)) v_~x$r_buff1_thd0~0_215) (= v_~x$w_buff0_used~0_437 (ite .cse0 v_~x$w_buff0_used~0_438 (ite .cse10 v_~x$w_buff0_used~0_438 (ite .cse11 0 v_~x$w_buff0_used~0_438)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_280, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_218, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~x$w_buff1~0=v_~x$w_buff1~0_269, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_119|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_427, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_216, ~x~0=v_~x~0_377, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_438, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_117|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_279, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_217, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~x$flush_delayed~0=v_~x$flush_delayed~0_145, ~x$w_buff1~0=v_~x$w_buff1~0_268, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_426, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~x$mem_tmp~0=v_~x$mem_tmp~0_120, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_215, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_437, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_194, ~x~0=v_~x~0_376} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~nondet13#1, ~weak$$choice2~0, ~x~0] [2022-12-13 00:47:48,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L763: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_927 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_319 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_929 256) 0))) (let ((.cse1 (and .cse0 (not .cse3))) (.cse2 (and .cse0 .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_662 (ite .cse1 v_~x$w_buff1~0_628 1)) v_~x~0_853) (= v_~x$r_buff0_thd2~0_265 v_~x$r_buff1_thd2~0_211) (= v_~x$w_buff1_used~0_888 (ite (or .cse2 .cse1) 0 v_~x$w_buff0_used~0_929)) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_47| |v_P1Thread1of1ForFork0_~arg#1.offset_47|) (= v_~x$w_buff0~0_663 v_~x$w_buff1~0_628) (= v_P0Thread1of1ForFork1_~arg.offset_68 |v_P0Thread1of1ForFork1_#in~arg.offset_68|) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_85|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_85| 0)) (= 2 v_~x$w_buff0~0_662) (= v_~x$r_buff0_thd1~0_318 (ite .cse2 0 v_~x$r_buff0_thd1~0_319)) (= v_~x$w_buff0_used~0_927 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_85| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_85|) (= v_~x$r_buff0_thd2~0_264 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_68| v_P0Thread1of1ForFork1_~arg.base_68) (= (ite (or (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_318 256) 0))) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_888 256) 0)))) 0 v_~x$r_buff0_thd1~0_319) v_~x$r_buff1_thd1~0_319) (= |v_P1Thread1of1ForFork0_~arg#1.base_47| |v_P1Thread1of1ForFork0_#in~arg#1.base_47|) (= v_~x$r_buff0_thd0~0_556 v_~x$r_buff1_thd0~0_554)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_663, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_556, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_319, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_68|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_68|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_265, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_47|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_929} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_662, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_556, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_85|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_318, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_47|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_47|, ~x$w_buff1~0=v_~x$w_buff1~0_628, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_888, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_211, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_319, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_85|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_68|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_264, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_554, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_927, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_47|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_68|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_68, ~x~0=v_~x~0_853} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~x~0] and [479] L804-->L815: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| 0)) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:47:51,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L815: Formula: (and (= v_~y$w_buff0~0_352 1) (= v_~y$w_buff0_used~0_540 v_~y$w_buff1_used~0_489) (= v_~x$r_buff0_thd2~0_343 v_~x$r_buff1_thd2~0_271) (= v_~x$w_buff0_used~0_1136 v_~x$w_buff1_used~0_1090) (= |v_P1Thread1of1ForFork0_~arg#1.base_65| |v_P1Thread1of1ForFork0_#in~arg#1.base_65|) (= v_~y$r_buff0_thd2~0_286 v_~y$r_buff1_thd2~0_236) (= v_~y$r_buff0_thd2~0_285 1) (= v_~y$w_buff1~0_311 v_~y$w_buff0~0_353) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_111| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_111|) (= v_~x$r_buff0_thd1~0_434 v_~x$r_buff1_thd1~0_431) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_111| 0)) (= v_~x$w_buff0~0_801 v_~x$w_buff1~0_760) (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_316) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_539 256) 0)) (not (= (mod v_~y$w_buff1_used~0_489 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_111|) (= v_~y$w_buff0_used~0_539 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_65| |v_P1Thread1of1ForFork0_~arg#1.offset_65|) (= v_~x$r_buff0_thd2~0_342 1) (= v_~y$r_buff0_thd1~0_71 v_~y$r_buff1_thd1~0_73) (not (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_1135 256) 0)) (not (= (mod v_~x$w_buff1_used~0_1090 256) 0)))) 1 0) 0)) (= v_~x$w_buff0_used~0_1135 1) (= 2 v_~x$w_buff0~0_800) (= v_~x$r_buff0_thd0~0_646 v_~x$r_buff1_thd0~0_654)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_801, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_646, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_434, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_540, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_353, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_286, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_343, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_800, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_434, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_65|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_539, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_431, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_111|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~y$w_buff0~0=v_~y$w_buff0~0_352, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_111|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_646, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_760, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_271, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_1090, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_342, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_654, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1135, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_236, ~y$w_buff1~0=v_~y$w_buff1~0_311, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_285, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_489} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~y$w_buff0_used~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [545] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_234 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_234, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:47:51,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] $Ultimate##0-->L815: Formula: (and (= v_~y$w_buff0~0_352 1) (= v_~y$w_buff0_used~0_540 v_~y$w_buff1_used~0_489) (= v_~x$r_buff0_thd2~0_343 v_~x$r_buff1_thd2~0_271) (= v_~x$w_buff0_used~0_1136 v_~x$w_buff1_used~0_1090) (= |v_P1Thread1of1ForFork0_~arg#1.base_65| |v_P1Thread1of1ForFork0_#in~arg#1.base_65|) (= v_~y$r_buff0_thd2~0_286 v_~y$r_buff1_thd2~0_236) (= v_~y$r_buff0_thd2~0_285 1) (= v_~y$w_buff1~0_311 v_~y$w_buff0~0_353) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_111| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_111|) (= v_~x$r_buff0_thd1~0_434 v_~x$r_buff1_thd1~0_431) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_111| 0)) (= v_~x$w_buff0~0_801 v_~x$w_buff1~0_760) (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_316) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_539 256) 0)) (not (= (mod v_~y$w_buff1_used~0_489 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_111|) (= v_~y$w_buff0_used~0_539 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_65| |v_P1Thread1of1ForFork0_~arg#1.offset_65|) (= v_~x$r_buff0_thd2~0_342 1) (= v_~y$r_buff0_thd1~0_71 v_~y$r_buff1_thd1~0_73) (not (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_1135 256) 0)) (not (= (mod v_~x$w_buff1_used~0_1090 256) 0)))) 1 0) 0)) (= v_~x$w_buff0_used~0_1135 1) (= 2 v_~x$w_buff0~0_800) (= v_~x$r_buff0_thd0~0_646 v_~x$r_buff1_thd0~0_654)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_801, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_646, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_434, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_540, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$w_buff0~0=v_~y$w_buff0~0_353, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_286, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_343, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_800, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_434, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_65|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_539, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_431, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_111|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~y$w_buff0~0=v_~y$w_buff0~0_352, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_111|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_646, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_760, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_271, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_1090, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_342, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_654, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1135, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_236, ~y$w_buff1~0=v_~y$w_buff1~0_311, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_285, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_489} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~y$w_buff0_used~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [375] L884-->L895: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_68 256) 0))) (.cse5 (not (= (mod v_~y$r_buff1_thd0~0_34 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse11 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_223 256) 0))) (.cse10 (not (= (mod v_~x$r_buff0_thd0~0_70 256) 0)))) (let ((.cse2 (and .cse4 .cse10)) (.cse7 (and .cse6 .cse11)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse11)) (.cse8 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse5)) (.cse9 (and .cse10 (not (= (mod v_~x$w_buff0_used~0_224 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_217 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= v_~x$w_buff1_used~0_216 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_217)) (= v_~x$r_buff1_thd0~0_67 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_216 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_69 256) 0)))) 0 v_~x$r_buff1_thd0~0_68)) (= v_~x$r_buff0_thd0~0_69 (ite .cse2 0 v_~x$r_buff0_thd0~0_70)) (= (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_92 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse6)) 0 v_~y$r_buff1_thd0~0_34) v_~y$r_buff1_thd0~0_33) (= (ite .cse7 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff1_used~0_92 (ite (or .cse7 .cse8) 0 v_~y$w_buff1_used~0_93)) (= v_~x$w_buff0_used~0_223 (ite .cse9 0 v_~x$w_buff0_used~0_224)) (= (ite .cse0 v_~y$w_buff0~0_67 (ite .cse8 v_~y$w_buff1~0_60 v_~y~0_87)) v_~y~0_86) (= (ite .cse9 v_~x$w_buff0~0_121 (ite .cse1 v_~x$w_buff1~0_116 v_~x~0_178)) v_~x~0_177)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_217, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_224, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_121, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_216, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y~0=v_~y~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_33, ~x~0=v_~x~0_177, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0]