/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:38:35,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:38:35,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:38:35,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:38:35,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:38:35,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:38:35,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:38:35,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:38:35,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:38:35,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:38:35,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:38:35,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:38:35,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:38:35,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:38:35,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:38:35,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:38:35,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:38:35,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:38:35,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:38:35,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:38:35,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:38:35,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:38:35,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:38:35,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:38:35,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:38:35,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:38:35,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:38:35,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:38:35,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:38:35,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:38:35,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:38:35,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:38:35,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:38:35,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:38:35,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:38:35,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:38:35,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:38:35,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:38:35,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:38:35,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:38:35,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:38:35,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:38:35,269 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:38:35,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:38:35,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:38:35,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:38:35,271 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:38:35,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:38:35,272 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:38:35,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:38:35,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:38:35,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:38:35,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:38:35,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:38:35,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:38:35,274 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:38:35,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:38:35,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:38:35,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:38:35,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:38:35,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:38:35,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:38:35,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:38:35,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:38:35,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:38:35,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:38:35,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:38:35,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:38:35,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:38:35,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:38:35,276 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-06 06:38:35,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:38:35,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:38:35,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:38:35,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:38:35,628 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:38:35,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2022-12-06 06:38:36,664 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:38:36,956 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:38:36,956 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2022-12-06 06:38:36,984 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e209b49/0a0ebfd4899d4b34a5dd8b5852a7fd4a/FLAG251a1076c [2022-12-06 06:38:37,004 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e209b49/0a0ebfd4899d4b34a5dd8b5852a7fd4a [2022-12-06 06:38:37,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:38:37,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:38:37,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:38:37,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:38:37,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:38:37,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747a531f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37, skipping insertion in model container [2022-12-06 06:38:37,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:38:37,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:38:37,249 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/safe012_power.opt.i[951,964] [2022-12-06 06:38:37,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:38:37,484 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:38:37,504 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/safe012_power.opt.i[951,964] [2022-12-06 06:38:37,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:38:37,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:38:37,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:38:37,597 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:38:37,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37 WrapperNode [2022-12-06 06:38:37,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:38:37,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:38:37,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:38:37,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:38:37,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,646 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-12-06 06:38:37,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:38:37,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:38:37,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:38:37,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:38:37,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,673 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:38:37,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:38:37,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:38:37,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:38:37,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (1/1) ... [2022-12-06 06:38:37,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:38:37,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:38:37,715 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-06 06:38:37,723 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-06 06:38:37,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:38:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:38:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:38:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:38:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:38:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:38:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:38:37,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:38:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:38:37,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:38:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:38:37,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:38:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:38:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:38:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:38:37,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:38:37,751 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:38:37,978 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:38:37,979 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:38:38,371 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:38:38,701 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:38:38,701 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:38:38,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:38:38 BoogieIcfgContainer [2022-12-06 06:38:38,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:38:38,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:38:38,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:38:38,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:38:38,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:38:37" (1/3) ... [2022-12-06 06:38:38,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723a0108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:38:38, skipping insertion in model container [2022-12-06 06:38:38,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:38:37" (2/3) ... [2022-12-06 06:38:38,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723a0108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:38:38, skipping insertion in model container [2022-12-06 06:38:38,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:38:38" (3/3) ... [2022-12-06 06:38:38,714 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-12-06 06:38:38,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:38:38,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:38:38,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:38:38,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:38:38,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 06:38:38,911 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:38:38,911 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:38,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:38:38,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 06:38:38,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-06 06:38:38,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:38,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 06:38:38,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-06 06:38:39,002 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:38:39,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:39,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:38:39,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 06:38:39,008 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-06 06:38:49,371 INFO L203 LiptonReduction]: Total number of compositions: 102 [2022-12-06 06:38:49,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:38:49,391 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;@437d8e7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:38:49,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:38:49,396 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 06:38:49,396 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:49,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:49,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:38:49,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:49,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1555944793, now seen corresponding path program 1 times [2022-12-06 06:38:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:49,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732746635] [2022-12-06 06:38:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:49,792 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-06 06:38:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:49,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732746635] [2022-12-06 06:38:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732746635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:49,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:49,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650684305] [2022-12-06 06:38:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:49,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:49,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:38:49,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 06:38:49,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:49,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:38:49,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:50,250 INFO L130 PetriNetUnfolder]: 809/1229 cut-off events. [2022-12-06 06:38:50,250 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:38:50,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1229 events. 809/1229 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5845 event pairs, 278 based on Foata normal form. 0/1081 useless extension candidates. Maximal degree in co-relation 2482. Up to 775 conditions per place. [2022-12-06 06:38:50,261 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 26 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2022-12-06 06:38:50,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2022-12-06 06:38:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 06:38:50,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-06 06:38:50,275 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 45 transitions. [2022-12-06 06:38:50,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2022-12-06 06:38:50,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:38:50,279 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-06 06:38:50,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 06:38:50,284 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:38:50,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:50,285 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-06 06:38:50,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:50,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:50,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-06 06:38:50,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:38:50,296 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:38:50,296 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:50,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:38:50,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:38:50,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:38:50,444 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:50,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 06:38:50,446 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:38:50,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 06:38:50,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:50,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:50,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:38:50,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1908787455, now seen corresponding path program 1 times [2022-12-06 06:38:50,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:50,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27300848] [2022-12-06 06:38:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:50,705 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-06 06:38:50,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:50,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27300848] [2022-12-06 06:38:50,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27300848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:50,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:50,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:38:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967789884] [2022-12-06 06:38:50,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:50,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:38:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:38:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:38:50,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:38:50,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:38:50,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:50,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:38:50,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:50,904 INFO L130 PetriNetUnfolder]: 470/802 cut-off events. [2022-12-06 06:38:50,904 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 06:38:50,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1621 conditions, 802 events. 470/802 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3864 event pairs, 102 based on Foata normal form. 20/818 useless extension candidates. Maximal degree in co-relation 1611. Up to 573 conditions per place. [2022-12-06 06:38:50,912 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 06:38:50,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 144 flow [2022-12-06 06:38:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:38:50,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:38:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:38:50,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 06:38:50,914 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:38:50,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 144 flow [2022-12-06 06:38:50,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:50,915 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 54 flow [2022-12-06 06:38:50,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-12-06 06:38:50,917 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-06 06:38:50,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:50,918 INFO L89 Accepts]: Start accepts. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 06:38:50,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:50,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:50,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 06:38:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2022-12-06 06:38:50,924 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:38:50,924 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:38:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:38:50,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 54 flow [2022-12-06 06:38:50,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 06:38:50,940 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:38:50,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:38:50,942 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 06:38:50,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:38:50,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:50,942 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:50,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:38:50,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:50,943 INFO L85 PathProgramCache]: Analyzing trace with hash -957132050, now seen corresponding path program 1 times [2022-12-06 06:38:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:50,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941166863] [2022-12-06 06:38:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:51,160 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-06 06:38:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:51,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941166863] [2022-12-06 06:38:51,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941166863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:51,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:51,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:38:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185814740] [2022-12-06 06:38:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:51,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:38:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:51,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:38:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:38:51,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:38:51,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-06 06:38:51,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:51,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:38:51,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:51,394 INFO L130 PetriNetUnfolder]: 690/1119 cut-off events. [2022-12-06 06:38:51,395 INFO L131 PetriNetUnfolder]: For 135/135 co-relation queries the response was YES. [2022-12-06 06:38:51,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 1119 events. 690/1119 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5212 event pairs, 211 based on Foata normal form. 50/1168 useless extension candidates. Maximal degree in co-relation 2427. Up to 378 conditions per place. [2022-12-06 06:38:51,401 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 30 selfloop transitions, 3 changer transitions 3/37 dead transitions. [2022-12-06 06:38:51,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 163 flow [2022-12-06 06:38:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:38:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:38:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:38:51,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 06:38:51,403 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:38:51,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 163 flow [2022-12-06 06:38:51,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:38:51,404 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 64 flow [2022-12-06 06:38:51,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2022-12-06 06:38:51,405 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-06 06:38:51,405 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:51,405 INFO L89 Accepts]: Start accepts. Operand has 33 places, 20 transitions, 64 flow [2022-12-06 06:38:51,406 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:51,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:51,406 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 20 transitions, 64 flow [2022-12-06 06:38:51,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 20 transitions, 64 flow [2022-12-06 06:38:51,412 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:38:51,412 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:38:51,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 20 events. 0/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:38:51,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 20 transitions, 64 flow [2022-12-06 06:38:51,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 06:38:52,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [758] $Ultimate##0-->L826: Formula: (let ((.cse1 (= (mod v_~y$w_buff0_used~0_411 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd3~0_232 256) 0)) (.cse17 (mod v_~weak$$choice0~0_113 256)) (.cse12 (mod v_~y$w_buff0_used~0_412 256))) (let ((.cse13 (= .cse12 0)) (.cse25 (= .cse17 0)) (.cse26 (= (mod v_~y$w_buff1_used~0_388 256) 0)) (.cse11 (select |v_#memory_int_415| |v_~#y~0.base_212|)) (.cse18 (= (mod v_~weak$$choice2~0_86 256) 0)) (.cse14 (not .cse4)) (.cse6 (not .cse1))) (let ((.cse2 (and .cse14 .cse6)) (.cse8 (not (= 0 (mod v_~y$w_buff1_used~0_387 256)))) (.cse0 (not .cse18)) (.cse16 (= (mod v_~weak$$choice1~0_134 256) 0)) (.cse10 (select .cse11 |v_~#y~0.offset_212|)) (.cse3 (not .cse26)) (.cse9 (not .cse25)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_236 256) 0)) (.cse15 (not .cse13))) (and (= v_~weak$$choice1~0_134 |v_P2Thread1of1ForFork0_#t~nondet9_42|) (= v_~y$w_buff1_used~0_387 (ite .cse0 v_~y$w_buff1_used~0_388 (ite .cse1 v_~y$w_buff1_used~0_388 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~weak$$choice0~0_113 0))))) (= 0 v_~y$flush_delayed~0_74) (= v_~weak$$choice0~0_113 |v_P2Thread1of1ForFork0_#t~nondet6_42|) (= v_~y$r_buff1_thd3~0_235 (ite .cse0 v_~y$r_buff1_thd3~0_236 (ite .cse1 v_~y$r_buff1_thd3~0_236 (let ((.cse7 (= (mod v_~y$r_buff0_thd3~0_231 256) 0))) (ite (and .cse6 (not .cse7)) 0 (ite (and .cse5 .cse8 .cse6 .cse7) (ite .cse9 v_~y$r_buff1_thd3~0_236 0) 0)))))) (= v_~y$mem_tmp~0_50 .cse10) (= v_~y$w_buff1~0_216 v_~y$w_buff1~0_215) (= v_~y$w_buff0~0_232 v_~y$w_buff0~0_231) (= (store |v_#memory_int_415| |v_~#y~0.base_212| (store .cse11 |v_~#y~0.offset_212| |v_P2_#t~ite21_50|)) |v_#memory_int_414|) (= (ite .cse0 v_~y$r_buff0_thd3~0_232 (ite .cse1 v_~y$r_buff0_thd3~0_232 (ite .cse2 0 (ite (and .cse4 .cse5 .cse8 .cse6) v_~y$r_buff0_thd3~0_232 0)))) v_~y$r_buff0_thd3~0_231) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~__unbuffered_p2_EAX$read_delayed~0_89 1) (= v_~weak$$choice2~0_86 |v_P2Thread1of1ForFork0_#t~nondet7_42|) (= v_~y$w_buff0_used~0_411 (ite (= (ite .cse0 .cse12 (ite .cse13 .cse12 (ite (and .cse14 .cse15) 0 (ite (and .cse3 .cse15 .cse4 .cse5) (ite (or .cse16 .cse9) 1 0) .cse17)))) 0) 0 1)) (= |v_~#y~0.offset_212| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_92) (or (and (= |v_P2Thread1of1ForFork0_#t~mem20_42| |v_P2_#t~mem20_55|) .cse0 (= |v_P2_#t~ite21_50| v_~y$mem_tmp~0_50)) (and (= |v_P2_#t~mem20_55| v_~__unbuffered_p2_EAX~0_129) .cse18 (= |v_P2_#t~ite21_50| |v_P2_#t~mem20_55|))) (= v_~z~0_43 1) (let ((.cse19 (= |v_P2Thread1of1ForFork0_#t~mem13_42| |v_P2_#t~mem13_91|)) (.cse20 (= |v_P2_#t~ite14_88| |v_P2Thread1of1ForFork0_#t~ite14_42|)) (.cse21 (= |v_P2_#t~ite16_68| |v_P2Thread1of1ForFork0_#t~ite16_42|)) (.cse22 (= |v_P2Thread1of1ForFork0_#t~mem11_42| |v_P2_#t~mem11_75|)) (.cse23 (= |v_P2_#t~ite15_70| |v_P2Thread1of1ForFork0_#t~ite15_42|)) (.cse24 (= |v_P2_#t~ite12_74| |v_P2Thread1of1ForFork0_#t~ite12_42|))) (or (and .cse19 (= |v_P2_#t~mem10_55| .cse10) .cse13 .cse20 .cse21 (= |v_P2_#t~ite17_58| |v_P2Thread1of1ForFork0_#t~ite17_42|) .cse22 .cse23 .cse24 (= |v_P2_#t~mem10_55| v_~__unbuffered_p2_EAX~0_129)) (and (or (and .cse4 (or (and .cse3 (or (and .cse25 (= |v_P2_#t~ite12_74| (ite (not .cse16) v_~y$w_buff0~0_232 v_~y$w_buff1~0_216)) .cse22) (and (= |v_P2_#t~ite12_74| |v_P2_#t~mem11_75|) .cse9 (= |v_P2_#t~mem11_75| .cse10))) .cse5 .cse19 .cse20 (= |v_P2_#t~ite16_68| |v_P2_#t~ite12_74|) .cse23) (and (= |v_P2_#t~ite15_70| |v_P2_#t~ite16_68|) (or (and (or (and .cse25 (= |v_P2_#t~mem13_91| .cse10) (= |v_P2_#t~ite14_88| |v_P2_#t~mem13_91|)) (and .cse19 (= |v_P2_#t~ite14_88| v_~y$w_buff0~0_232) .cse9)) (= |v_P2_#t~ite15_70| |v_P2_#t~ite14_88|) .cse26) (and .cse3 .cse19 (= |v_P2_#t~ite15_70| (ite .cse9 v_~y$w_buff1~0_216 v_~y$w_buff0~0_232)) .cse20)) .cse22 .cse24 (or (not .cse5) .cse26))) (= |v_P2_#t~ite16_68| |v_P2_#t~ite17_58|)) (and .cse14 (= |v_P2_#t~ite17_58| v_~y$w_buff0~0_232) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)) .cse15 (= |v_P2_#t~ite17_58| v_~__unbuffered_p2_EAX~0_129) (= |v_P2Thread1of1ForFork0_#t~mem10_42| |v_P2_#t~mem10_55|)))) (= |v_~#y~0.base_212| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_92) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23))))) InVars {~#y~0.offset=|v_~#y~0.offset_212|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_412, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_42|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_42|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_42|, ~#y~0.base=|v_~#y~0.base_212|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_42|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_42|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_42|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_236, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_42|, ~y$w_buff1~0=v_~y$w_buff1~0_216, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_232, ~y$w_buff0~0=v_~y$w_buff0~0_232, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_42|, #memory_int=|v_#memory_int_415|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_42|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_42|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_42|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_388, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_42|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_23|, ~#y~0.offset=|v_~#y~0.offset_212|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_411, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_92, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_92, ~#y~0.base=|v_~#y~0.base_212|, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~weak$$choice1~0=v_~weak$$choice1~0_134, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_235, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_231, ~y$w_buff0~0=v_~y$w_buff0~0_231, ~y$flush_delayed~0=v_~y$flush_delayed~0_74, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_129, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_89, ~weak$$choice0~0=v_~weak$$choice0~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_215, #memory_int=|v_#memory_int_414|, ~z~0=v_~z~0_43, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_23|, ~weak$$choice2~0=v_~weak$$choice2~0_86, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_387} AuxVars[|v_P2_#t~mem13_91|, |v_P2_#t~ite21_50|, |v_P2_#t~ite15_70|, |v_P2_#t~mem20_55|, |v_P2_#t~mem11_75|, |v_P2_#t~ite16_68|, |v_P2_#t~ite12_74|, |v_P2_#t~ite14_88|, |v_P2_#t~ite17_58|, |v_P2_#t~mem10_55|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [699] $Ultimate##0-->L763: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_29)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:38:53,849 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:53,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2445 [2022-12-06 06:38:53,850 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2022-12-06 06:38:53,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-06 06:38:53,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:53,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:53,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:38:53,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -955371560, now seen corresponding path program 1 times [2022-12-06 06:38:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:53,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304700426] [2022-12-06 06:38:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:38:55,038 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-06 06:38:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:38:55,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304700426] [2022-12-06 06:38:55,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304700426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:38:55,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:38:55,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:38:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926480333] [2022-12-06 06:38:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:38:55,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:38:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:38:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:38:55,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:38:55,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:38:55,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-06 06:38:55,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:38:55,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:38:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:38:55,258 INFO L130 PetriNetUnfolder]: 240/405 cut-off events. [2022-12-06 06:38:55,258 INFO L131 PetriNetUnfolder]: For 246/246 co-relation queries the response was YES. [2022-12-06 06:38:55,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 405 events. 240/405 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1636 event pairs, 95 based on Foata normal form. 6/411 useless extension candidates. Maximal degree in co-relation 956. Up to 337 conditions per place. [2022-12-06 06:38:55,262 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 27 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2022-12-06 06:38:55,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 176 flow [2022-12-06 06:38:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:38:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:38:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 06:38:55,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 06:38:55,264 INFO L175 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 5 states and 42 transitions. [2022-12-06 06:38:55,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 176 flow [2022-12-06 06:38:55,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 156 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 06:38:55,266 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 102 flow [2022-12-06 06:38:55,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-06 06:38:55,267 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-06 06:38:55,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:38:55,267 INFO L89 Accepts]: Start accepts. Operand has 33 places, 25 transitions, 102 flow [2022-12-06 06:38:55,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:38:55,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:38:55,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 102 flow [2022-12-06 06:38:55,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 102 flow [2022-12-06 06:38:55,280 INFO L130 PetriNetUnfolder]: 12/52 cut-off events. [2022-12-06 06:38:55,281 INFO L131 PetriNetUnfolder]: For 16/19 co-relation queries the response was YES. [2022-12-06 06:38:55,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 52 events. 12/52 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 167 event pairs, 4 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 115. Up to 24 conditions per place. [2022-12-06 06:38:55,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 102 flow [2022-12-06 06:38:55,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-06 06:38:55,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [759] $Ultimate##0-->L763: Formula: (let ((.cse17 (mod v_~weak$$choice0~0_115 256)) (.cse12 (mod v_~y$w_buff0_used~0_422 256)) (.cse11 (= 0 (mod v_~y$r_buff0_thd3~0_238 256))) (.cse2 (= (mod v_~y$w_buff0_used~0_421 256) 0))) (let ((.cse8 (select |v_#memory_int_425| |v_~#y~0.base_216|)) (.cse3 (not .cse2)) (.cse14 (not .cse11)) (.cse0 (= (mod v_~weak$$choice2~0_88 256) 0)) (.cse13 (= .cse12 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_397 256) 0)) (.cse19 (= .cse17 0))) (let ((.cse16 (= (mod v_~weak$$choice1~0_138 256) 0)) (.cse7 (not .cse19)) (.cse10 (not .cse24)) (.cse15 (not .cse13)) (.cse1 (not .cse0)) (.cse9 (and .cse3 .cse14)) (.cse5 (not (= (mod v_~y$w_buff1_used~0_396 256) 0))) (.cse6 (= (mod v_~y$r_buff1_thd3~0_242 256) 0)) (.cse18 (select .cse8 |v_~#y~0.offset_216|))) (and (or (and (= |v_P2_#t~ite21_52| |v_P2_#t~mem20_57|) .cse0 (= |v_P2_#t~mem20_57| v_~__unbuffered_p2_EAX~0_135)) (and .cse1 (= |v_P2_#t~ite21_52| v_~y$mem_tmp~0_52) (= |v_P2Thread1of1ForFork0_#t~mem20_46| |v_P2_#t~mem20_57|))) (= (ite .cse1 v_~y$r_buff1_thd3~0_242 (ite .cse2 v_~y$r_buff1_thd3~0_242 (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_237 256) 0))) (ite (and .cse3 (not .cse4)) 0 (ite (and .cse5 .cse4 .cse3 .cse6) (ite .cse7 v_~y$r_buff1_thd3~0_242 0) 0))))) v_~y$r_buff1_thd3~0_241) (= (store |v_#memory_int_425| |v_~#y~0.base_216| (store .cse8 |v_~#y~0.offset_216| |v_P2_#t~ite21_52|)) |v_#memory_int_424|) (= v_~y$w_buff1_used~0_396 (ite .cse1 v_~y$w_buff1_used~0_397 (ite .cse2 v_~y$w_buff1_used~0_397 (ite .cse9 0 (ite (and .cse10 .cse11 .cse3 .cse6) v_~weak$$choice0~0_115 0))))) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= (ite (= (ite .cse1 .cse12 (ite .cse13 .cse12 (ite (and .cse14 .cse15) 0 (ite (and .cse10 .cse11 .cse6 .cse15) (ite (or .cse7 .cse16) 1 0) .cse17)))) 0) 0 1) v_~y$w_buff0_used~0_421) (= v_~__unbuffered_p2_EAX$read_delayed~0_93 1) (= 0 v_~y$flush_delayed~0_76) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z~0_45 1) (= v_~weak$$choice2~0_88 |v_P2Thread1of1ForFork0_#t~nondet7_46|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (let ((.cse25 (= |v_P2_#t~ite12_76| |v_P2Thread1of1ForFork0_#t~ite12_46|)) (.cse21 (= |v_P2Thread1of1ForFork0_#t~mem13_46| |v_P2_#t~mem13_93|)) (.cse26 (= |v_P2_#t~ite16_70| |v_P2Thread1of1ForFork0_#t~ite16_46|)) (.cse22 (= |v_P2_#t~ite14_90| |v_P2Thread1of1ForFork0_#t~ite14_46|)) (.cse20 (= |v_P2Thread1of1ForFork0_#t~mem11_46| |v_P2_#t~mem11_77|)) (.cse23 (= |v_P2_#t~ite15_72| |v_P2Thread1of1ForFork0_#t~ite15_46|))) (or (and (= |v_P2_#t~ite17_60| v_~__unbuffered_p2_EAX~0_135) (or (and (= |v_P2_#t~ite16_70| |v_P2_#t~ite17_60|) .cse11 (or (and (or (and (= .cse18 |v_P2_#t~mem11_77|) (= |v_P2_#t~ite12_76| |v_P2_#t~mem11_77|) .cse7) (and .cse19 (= |v_P2_#t~ite12_76| (ite (not .cse16) v_~y$w_buff0~0_240 v_~y$w_buff1~0_223)) .cse20)) .cse10 .cse21 .cse6 (= |v_P2_#t~ite16_70| |v_P2_#t~ite12_76|) .cse22 .cse23) (and (or (not .cse6) .cse24) (or (and (or (and .cse21 .cse7 (= |v_P2_#t~ite14_90| v_~y$w_buff0~0_240)) (and (= .cse18 |v_P2_#t~mem13_93|) .cse19 (= |v_P2_#t~ite14_90| |v_P2_#t~mem13_93|))) (= |v_P2_#t~ite15_72| |v_P2_#t~ite14_90|) .cse24) (and (= |v_P2_#t~ite15_72| (ite .cse7 v_~y$w_buff1~0_223 v_~y$w_buff0~0_240)) .cse10 .cse21 .cse22)) .cse25 (= |v_P2_#t~ite15_72| |v_P2_#t~ite16_70|) .cse20))) (and .cse25 .cse21 .cse26 (= |v_P2_#t~ite17_60| v_~y$w_buff0~0_240) .cse14 .cse22 .cse20 .cse23)) .cse15 (= |v_P2Thread1of1ForFork0_#t~mem10_46| |v_P2_#t~mem10_57|)) (and .cse25 (= |v_P2_#t~mem10_57| v_~__unbuffered_p2_EAX~0_135) .cse13 .cse21 (= .cse18 |v_P2_#t~mem10_57|) .cse26 .cse22 .cse20 (= |v_P2_#t~ite17_60| |v_P2Thread1of1ForFork0_#t~ite17_46|) .cse23))) (= (ite .cse1 v_~y$r_buff0_thd3~0_238 (ite .cse2 v_~y$r_buff0_thd3~0_238 (ite .cse9 0 (ite (and .cse5 .cse11 .cse3 .cse6) v_~y$r_buff0_thd3~0_238 0)))) v_~y$r_buff0_thd3~0_237) (= v_~y$w_buff0~0_239 v_~y$w_buff0~0_240) (= v_~z~0_45 v_~__unbuffered_p0_EAX~0_71) (= |v_~#y~0.offset_216| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_96) (= |v_~#y~0.base_216| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_96) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~y$mem_tmp~0_52 .cse18) (= v_~y$w_buff1~0_223 v_~y$w_buff1~0_222) (= v_~weak$$choice1~0_138 |v_P2Thread1of1ForFork0_#t~nondet9_46|) (= v_~weak$$choice0~0_115 |v_P2Thread1of1ForFork0_#t~nondet6_46|))))) InVars {~#y~0.offset=|v_~#y~0.offset_216|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_422, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_46|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_46|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_46|, ~#y~0.base=|v_~#y~0.base_216|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_242, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_238, ~y$w_buff0~0=v_~y$w_buff0~0_240, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_46|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_46|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_46|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_46|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_46|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_46|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_46|, ~y$w_buff1~0=v_~y$w_buff1~0_223, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_46|, #memory_int=|v_#memory_int_425|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_397, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_46|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_25|, ~#y~0.offset=|v_~#y~0.offset_216|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_421, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_96, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_96, ~#y~0.base=|v_~#y~0.base_216|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~weak$$choice1~0=v_~weak$$choice1~0_138, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_241, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_25|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_237, ~y$w_buff0~0=v_~y$w_buff0~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_76, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_135, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_25|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_93, ~weak$$choice0~0=v_~weak$$choice0~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_222, #memory_int=|v_#memory_int_424|, ~z~0=v_~z~0_45, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_25|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_396} AuxVars[|v_P2_#t~ite15_72|, |v_P2_#t~mem13_93|, |v_P2_#t~ite14_90|, |v_P2_#t~ite16_70|, |v_P2_#t~ite17_60|, |v_P2_#t~ite21_52|, |v_P2_#t~mem11_77|, |v_P2_#t~mem20_57|, |v_P2_#t~ite12_76|, |v_P2_#t~mem10_57|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:38:58,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (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_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~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$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~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, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:38:58,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (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_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~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$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~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, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [697] L2-1-->L866: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_51 256) 0))) (let ((.cse8 (= (mod v_~y$r_buff1_thd0~0_55 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_256 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_271 256) 0))) (.cse2 (not .cse5)) (.cse4 (= (mod v_~y$w_buff0_used~0_272 256) 0))) (let ((.cse1 (not .cse4)) (.cse6 (select |v_#memory_int_245| |v_~#y~0.base_154|)) (.cse0 (and .cse11 .cse2)) (.cse9 (not .cse7)) (.cse10 (not .cse8))) (and (= v_~y$r_buff0_thd0~0_50 (ite .cse0 0 v_~y$r_buff0_thd0~0_51)) (= v_~y$w_buff0_used~0_271 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_272)) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem31#1_44| |v_ULTIMATE.start_main_#t~mem31#1_42|))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_34| v_~y$w_buff0~0_147) (= |v_ULTIMATE.start_main_#t~ite32#1_39| |v_ULTIMATE.start_main_#t~ite32#1_41|) .cse3 .cse1 .cse2) (and (or .cse4 .cse5) (or (and (= (select .cse6 |v_~#y~0.offset_154|) |v_ULTIMATE.start_main_#t~mem31#1_42|) (= |v_ULTIMATE.start_main_#t~mem31#1_42| |v_ULTIMATE.start_main_#t~ite32#1_39|) (or .cse7 .cse8)) (and .cse9 .cse3 (= v_~y$w_buff1~0_135 |v_ULTIMATE.start_main_#t~ite32#1_39|) .cse10)) (= |v_ULTIMATE.start_main_#t~ite33#1_34| |v_ULTIMATE.start_main_#t~ite32#1_39|)))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_255 256) 0)) .cse10) (and .cse11 (not (= (mod v_~y$r_buff0_thd0~0_50 256) 0)))) 0 v_~y$r_buff1_thd0~0_55) v_~y$r_buff1_thd0~0_54) (= (store |v_#memory_int_245| |v_~#y~0.base_154| (store .cse6 |v_~#y~0.offset_154| |v_ULTIMATE.start_main_#t~ite33#1_34|)) |v_#memory_int_244|) (= (ite (or .cse0 (and .cse9 .cse10)) 0 v_~y$w_buff1_used~0_256) v_~y$w_buff1_used~0_255))))) InVars {~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_272, ~y$w_buff1~0=v_~y$w_buff1~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_44|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_147, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_41|, #memory_int=|v_#memory_int_245|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_256} OutVars{~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_271, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_33|, ~y$w_buff0~0=v_~y$w_buff0~0_147, #memory_int=|v_#memory_int_244|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_255} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_34|, |v_ULTIMATE.start_main_#t~ite32#1_39|, |v_ULTIMATE.start_main_#t~mem31#1_42|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:38:59,604 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:38:59,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4338 [2022-12-06 06:38:59,605 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 110 flow [2022-12-06 06:38:59,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-06 06:38:59,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:38:59,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:38:59,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:38:59,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:38:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:38:59,607 INFO L85 PathProgramCache]: Analyzing trace with hash -957130159, now seen corresponding path program 1 times [2022-12-06 06:38:59,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:38:59,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823552239] [2022-12-06 06:38:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:38:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:38:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:01,638 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-06 06:39:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:01,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823552239] [2022-12-06 06:39:01,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823552239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:01,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:01,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:39:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493769657] [2022-12-06 06:39:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:01,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:39:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:39:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:39:01,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:39:01,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-06 06:39:01,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:01,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:39:01,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:01,869 INFO L130 PetriNetUnfolder]: 236/401 cut-off events. [2022-12-06 06:39:01,869 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2022-12-06 06:39:01,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 401 events. 236/401 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1674 event pairs, 21 based on Foata normal form. 14/409 useless extension candidates. Maximal degree in co-relation 1110. Up to 255 conditions per place. [2022-12-06 06:39:01,874 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 27 selfloop transitions, 11 changer transitions 0/39 dead transitions. [2022-12-06 06:39:01,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 228 flow [2022-12-06 06:39:01,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:39:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:39:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:39:01,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 06:39:01,878 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 110 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:39:01,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 228 flow [2022-12-06 06:39:01,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 226 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:39:01,882 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 163 flow [2022-12-06 06:39:01,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-06 06:39:01,886 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:39:01,886 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:01,886 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 163 flow [2022-12-06 06:39:01,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:01,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:01,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 163 flow [2022-12-06 06:39:01,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 163 flow [2022-12-06 06:39:01,907 INFO L130 PetriNetUnfolder]: 20/62 cut-off events. [2022-12-06 06:39:01,908 INFO L131 PetriNetUnfolder]: For 81/95 co-relation queries the response was YES. [2022-12-06 06:39:01,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 62 events. 20/62 cut-off events. For 81/95 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 210 event pairs, 3 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 192. Up to 30 conditions per place. [2022-12-06 06:39:01,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 163 flow [2022-12-06 06:39:01,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:39:01,911 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:01,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:39:01,912 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 163 flow [2022-12-06 06:39:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-06 06:39:01,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:01,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:01,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:39:01,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1601556954, now seen corresponding path program 1 times [2022-12-06 06:39:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:01,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719222446] [2022-12-06 06:39:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:02,132 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-06 06:39:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:02,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719222446] [2022-12-06 06:39:02,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719222446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:02,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:02,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:39:02,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748774339] [2022-12-06 06:39:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:02,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:39:02,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:02,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:39:02,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:39:02,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:39:02,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:39:02,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:02,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:39:02,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:02,248 INFO L130 PetriNetUnfolder]: 149/273 cut-off events. [2022-12-06 06:39:02,248 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2022-12-06 06:39:02,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 273 events. 149/273 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1013 event pairs, 36 based on Foata normal form. 13/286 useless extension candidates. Maximal degree in co-relation 912. Up to 232 conditions per place. [2022-12-06 06:39:02,251 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 35 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2022-12-06 06:39:02,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 310 flow [2022-12-06 06:39:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:39:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:39:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:39:02,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2022-12-06 06:39:02,252 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 163 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:39:02,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 310 flow [2022-12-06 06:39:02,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 280 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 06:39:02,255 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 166 flow [2022-12-06 06:39:02,255 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 06:39:02,256 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:39:02,256 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:02,256 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 166 flow [2022-12-06 06:39:02,257 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:02,257 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:02,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 166 flow [2022-12-06 06:39:02,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 166 flow [2022-12-06 06:39:02,283 INFO L130 PetriNetUnfolder]: 63/145 cut-off events. [2022-12-06 06:39:02,283 INFO L131 PetriNetUnfolder]: For 88/102 co-relation queries the response was YES. [2022-12-06 06:39:02,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 145 events. 63/145 cut-off events. For 88/102 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 597 event pairs, 19 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 404. Up to 65 conditions per place. [2022-12-06 06:39:02,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 166 flow [2022-12-06 06:39:02,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-06 06:39:02,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] L855-3-->L2-1: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_23| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (mod v_~main$tmp_guard0~0_26 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_73) 1 0) 0) 0 1) v_~main$tmp_guard0~0_26)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_25|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_15|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [762] L778-->L866: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_109 256) 0))) (let ((.cse1 (not .cse3)) (.cse5 (not (= (mod v_~y$w_buff0_used~0_460 256) 0)))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (select |v_#memory_int_466| |v_~#y~0.base_232|)) (.cse2 (= (mod v_~y$w_buff0_used~0_462 256) 0))) (and (= v_~y$w_buff1~0_242 v_~y$w_buff0~0_264) (= v_~y$w_buff1_used~0_431 (ite (or .cse0 (and .cse1 (not .cse2))) 0 v_~y$w_buff0_used~0_462)) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_91| |v_ULTIMATE.start_main_#t~ite32#1_113|) .cse3 (= |v_ULTIMATE.start_main_#t~mem31#1_116| (select .cse4 |v_~#y~0.offset_232|)) (= |v_ULTIMATE.start_main_#t~mem31#1_116| |v_ULTIMATE.start_main_#t~ite32#1_113|)) (and .cse1 (= |v_ULTIMATE.start_main_#t~mem31#1_118| |v_ULTIMATE.start_main_#t~mem31#1_116|) (= |v_ULTIMATE.start_main_#t~ite33#1_91| v_~y$w_buff0~0_263) (= |v_ULTIMATE.start_main_#t~ite32#1_115| |v_ULTIMATE.start_main_#t~ite32#1_113|))) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_31| 0)) (= (ite .cse0 0 v_~y$r_buff0_thd0~0_109) v_~y$r_buff0_thd0~0_108) (= v_~y$w_buff0~0_263 1) (= |v_#memory_int_465| (store |v_#memory_int_466| |v_~#y~0.base_232| (store .cse4 |v_~#y~0.offset_232| |v_ULTIMATE.start_main_#t~ite33#1_91|))) (= v_~y$r_buff0_thd2~0_172 v_~y$r_buff1_thd2~0_140) (= v_~y$r_buff0_thd2~0_171 1) (= v_~y$w_buff0_used~0_460 (ite .cse1 0 1)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31| (ite .cse2 1 0)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_31|) (= v_~y$r_buff1_thd0~0_119 (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_431 256) 0))) (and .cse5 (not (= (mod v_~y$r_buff0_thd0~0_108 256) 0)))) 0 v_~y$r_buff0_thd0~0_109)) (= v_~y$r_buff0_thd3~0_259 v_~y$r_buff1_thd3~0_263) (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff1_thd1~0_51))))) InVars {~#y~0.offset=|v_~#y~0.offset_232|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_462, ~#y~0.base=|v_~#y~0.base_232|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_118|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_264, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_259, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_115|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, #memory_int=|v_#memory_int_466|} OutVars{~#y~0.offset=|v_~#y~0.offset_232|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_460, ~#y~0.base=|v_~#y~0.base_232|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_140, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_263, ~y$w_buff1~0=v_~y$w_buff1~0_242, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_90|, ~y$w_buff0~0=v_~y$w_buff0~0_263, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_259, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, #memory_int=|v_#memory_int_465|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_431} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_113|, |v_ULTIMATE.start_main_#t~mem31#1_116|, |v_ULTIMATE.start_main_#t~ite33#1_91|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 06:39:02,638 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:39:02,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 06:39:02,639 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 168 flow [2022-12-06 06:39:02,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-06 06:39:02,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:02,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:02,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:39:02,640 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash -654295988, now seen corresponding path program 1 times [2022-12-06 06:39:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:02,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280977666] [2022-12-06 06:39:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:03,992 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-06 06:39:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:03,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280977666] [2022-12-06 06:39:03,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280977666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:03,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:03,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:39:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659410384] [2022-12-06 06:39:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:39:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:39:03,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:39:03,995 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:39:03,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-06 06:39:03,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:03,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:39:03,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:04,208 INFO L130 PetriNetUnfolder]: 163/297 cut-off events. [2022-12-06 06:39:04,208 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-06 06:39:04,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 297 events. 163/297 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1146 event pairs, 37 based on Foata normal form. 3/298 useless extension candidates. Maximal degree in co-relation 1070. Up to 255 conditions per place. [2022-12-06 06:39:04,211 INFO L137 encePairwiseOnDemand]: 11/22 looper letters, 35 selfloop transitions, 11 changer transitions 0/47 dead transitions. [2022-12-06 06:39:04,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 341 flow [2022-12-06 06:39:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:39:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:39:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-06 06:39:04,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 06:39:04,213 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 168 flow. Second operand 5 states and 44 transitions. [2022-12-06 06:39:04,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 341 flow [2022-12-06 06:39:04,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:39:04,215 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 242 flow [2022-12-06 06:39:04,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-06 06:39:04,216 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-06 06:39:04,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:04,216 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 242 flow [2022-12-06 06:39:04,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:04,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:04,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 242 flow [2022-12-06 06:39:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 242 flow [2022-12-06 06:39:04,242 INFO L130 PetriNetUnfolder]: 65/152 cut-off events. [2022-12-06 06:39:04,242 INFO L131 PetriNetUnfolder]: For 197/218 co-relation queries the response was YES. [2022-12-06 06:39:04,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 152 events. 65/152 cut-off events. For 197/218 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 673 event pairs, 13 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 470. Up to 69 conditions per place. [2022-12-06 06:39:04,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 242 flow [2022-12-06 06:39:04,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 06:39:04,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:39:04,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-06 06:39:04,680 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 244 flow [2022-12-06 06:39:04,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-06 06:39:04,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:04,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:04,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:39:04,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -783022930, now seen corresponding path program 1 times [2022-12-06 06:39:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:04,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684416623] [2022-12-06 06:39:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:04,851 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-06 06:39:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684416623] [2022-12-06 06:39:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684416623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:04,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:39:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430270313] [2022-12-06 06:39:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:04,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:04,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:39:04,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 244 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-06 06:39:04,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:04,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:39:04,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:05,065 INFO L130 PetriNetUnfolder]: 323/573 cut-off events. [2022-12-06 06:39:05,065 INFO L131 PetriNetUnfolder]: For 1351/1351 co-relation queries the response was YES. [2022-12-06 06:39:05,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 573 events. 323/573 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2603 event pairs, 41 based on Foata normal form. 14/587 useless extension candidates. Maximal degree in co-relation 2205. Up to 301 conditions per place. [2022-12-06 06:39:05,070 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 17/69 dead transitions. [2022-12-06 06:39:05,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 619 flow [2022-12-06 06:39:05,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:39:05,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:39:05,072 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 244 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:39:05,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 619 flow [2022-12-06 06:39:05,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 69 transitions, 574 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 06:39:05,078 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 235 flow [2022-12-06 06:39:05,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-06 06:39:05,080 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-06 06:39:05,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:05,080 INFO L89 Accepts]: Start accepts. Operand has 46 places, 36 transitions, 235 flow [2022-12-06 06:39:05,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:05,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:05,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 235 flow [2022-12-06 06:39:05,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 235 flow [2022-12-06 06:39:05,115 INFO L130 PetriNetUnfolder]: 99/242 cut-off events. [2022-12-06 06:39:05,115 INFO L131 PetriNetUnfolder]: For 325/329 co-relation queries the response was YES. [2022-12-06 06:39:05,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 242 events. 99/242 cut-off events. For 325/329 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1271 event pairs, 25 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 710. Up to 130 conditions per place. [2022-12-06 06:39:05,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 235 flow [2022-12-06 06:39:05,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-06 06:39:05,248 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:39:05,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 06:39:05,249 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 238 flow [2022-12-06 06:39:05,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-06 06:39:05,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:05,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:05,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:39:05,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1000465868, now seen corresponding path program 1 times [2022-12-06 06:39:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:05,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140760960] [2022-12-06 06:39:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:06,406 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-06 06:39:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:06,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140760960] [2022-12-06 06:39:06,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140760960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:06,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:06,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:39:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099585556] [2022-12-06 06:39:06,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:06,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:39:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:39:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:39:06,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:39:06,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-06 06:39:06,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:06,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:39:06,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:06,674 INFO L130 PetriNetUnfolder]: 264/486 cut-off events. [2022-12-06 06:39:06,675 INFO L131 PetriNetUnfolder]: For 1126/1131 co-relation queries the response was YES. [2022-12-06 06:39:06,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 486 events. 264/486 cut-off events. For 1126/1131 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2225 event pairs, 54 based on Foata normal form. 5/488 useless extension candidates. Maximal degree in co-relation 1905. Up to 302 conditions per place. [2022-12-06 06:39:06,679 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 35 selfloop transitions, 15 changer transitions 0/52 dead transitions. [2022-12-06 06:39:06,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 413 flow [2022-12-06 06:39:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:39:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:39:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 06:39:06,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 06:39:06,681 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 238 flow. Second operand 5 states and 43 transitions. [2022-12-06 06:39:06,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 413 flow [2022-12-06 06:39:06,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 406 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:39:06,685 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 283 flow [2022-12-06 06:39:06,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-06 06:39:06,686 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2022-12-06 06:39:06,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:06,686 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 283 flow [2022-12-06 06:39:06,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:06,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:06,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 283 flow [2022-12-06 06:39:06,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 283 flow [2022-12-06 06:39:06,723 INFO L130 PetriNetUnfolder]: 98/245 cut-off events. [2022-12-06 06:39:06,723 INFO L131 PetriNetUnfolder]: For 458/461 co-relation queries the response was YES. [2022-12-06 06:39:06,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 245 events. 98/245 cut-off events. For 458/461 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1344 event pairs, 22 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 790. Up to 132 conditions per place. [2022-12-06 06:39:06,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 283 flow [2022-12-06 06:39:06,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 06:39:06,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:06,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 06:39:06,730 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 283 flow [2022-12-06 06:39:06,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-06 06:39:06,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:06,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:06,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:39:06,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1291195749, now seen corresponding path program 1 times [2022-12-06 06:39:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:06,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673569522] [2022-12-06 06:39:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:06,962 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-06 06:39:06,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:06,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673569522] [2022-12-06 06:39:06,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673569522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:06,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:06,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:39:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693050710] [2022-12-06 06:39:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:06,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:06,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:39:06,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-06 06:39:06,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:06,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:39:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:07,095 INFO L130 PetriNetUnfolder]: 112/245 cut-off events. [2022-12-06 06:39:07,096 INFO L131 PetriNetUnfolder]: For 827/832 co-relation queries the response was YES. [2022-12-06 06:39:07,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 245 events. 112/245 cut-off events. For 827/832 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 995 event pairs, 13 based on Foata normal form. 40/284 useless extension candidates. Maximal degree in co-relation 1040. Up to 130 conditions per place. [2022-12-06 06:39:07,098 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 41 selfloop transitions, 7 changer transitions 1/51 dead transitions. [2022-12-06 06:39:07,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 466 flow [2022-12-06 06:39:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 06:39:07,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2022-12-06 06:39:07,101 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 283 flow. Second operand 4 states and 47 transitions. [2022-12-06 06:39:07,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 466 flow [2022-12-06 06:39:07,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 391 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-06 06:39:07,107 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 212 flow [2022-12-06 06:39:07,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-06 06:39:07,108 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-06 06:39:07,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:07,108 INFO L89 Accepts]: Start accepts. Operand has 47 places, 34 transitions, 212 flow [2022-12-06 06:39:07,109 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:07,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:07,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 212 flow [2022-12-06 06:39:07,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 212 flow [2022-12-06 06:39:07,132 INFO L130 PetriNetUnfolder]: 41/136 cut-off events. [2022-12-06 06:39:07,132 INFO L131 PetriNetUnfolder]: For 135/151 co-relation queries the response was YES. [2022-12-06 06:39:07,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 136 events. 41/136 cut-off events. For 135/151 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 635 event pairs, 4 based on Foata normal form. 6/137 useless extension candidates. Maximal degree in co-relation 437. Up to 67 conditions per place. [2022-12-06 06:39:07,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 212 flow [2022-12-06 06:39:07,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 06:39:07,777 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:39:07,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 670 [2022-12-06 06:39:07,779 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 220 flow [2022-12-06 06:39:07,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-06 06:39:07,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:07,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:07,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:39:07,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash -342753994, now seen corresponding path program 1 times [2022-12-06 06:39:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:07,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413941731] [2022-12-06 06:39:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:08,020 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-06 06:39:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:08,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413941731] [2022-12-06 06:39:08,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413941731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:08,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:08,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:39:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882429659] [2022-12-06 06:39:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:08,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:39:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:39:08,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:39:08,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:39:08,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 06:39:08,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:08,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:39:08,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:08,127 INFO L130 PetriNetUnfolder]: 76/168 cut-off events. [2022-12-06 06:39:08,128 INFO L131 PetriNetUnfolder]: For 402/410 co-relation queries the response was YES. [2022-12-06 06:39:08,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 168 events. 76/168 cut-off events. For 402/410 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 652 event pairs, 8 based on Foata normal form. 22/177 useless extension candidates. Maximal degree in co-relation 728. Up to 74 conditions per place. [2022-12-06 06:39:08,129 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 26 selfloop transitions, 10 changer transitions 12/49 dead transitions. [2022-12-06 06:39:08,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 415 flow [2022-12-06 06:39:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:39:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:39:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 06:39:08,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 06:39:08,130 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 220 flow. Second operand 5 states and 50 transitions. [2022-12-06 06:39:08,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 415 flow [2022-12-06 06:39:08,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 350 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-06 06:39:08,132 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 161 flow [2022-12-06 06:39:08,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2022-12-06 06:39:08,133 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-06 06:39:08,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:08,133 INFO L89 Accepts]: Start accepts. Operand has 47 places, 27 transitions, 161 flow [2022-12-06 06:39:08,136 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:08,136 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:08,136 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 27 transitions, 161 flow [2022-12-06 06:39:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 27 transitions, 161 flow [2022-12-06 06:39:08,146 INFO L130 PetriNetUnfolder]: 12/50 cut-off events. [2022-12-06 06:39:08,146 INFO L131 PetriNetUnfolder]: For 65/67 co-relation queries the response was YES. [2022-12-06 06:39:08,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 50 events. 12/50 cut-off events. For 65/67 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 144 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 152. Up to 17 conditions per place. [2022-12-06 06:39:08,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 27 transitions, 161 flow [2022-12-06 06:39:08,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 06:39:08,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] L778-->L833: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd3~0_256 256) 0))) (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_454 256) 0))) (.cse3 (not .cse5))) (let ((.cse2 (= (mod v_~y$w_buff0_used~0_456 256) 0)) (.cse1 (and .cse4 .cse3)) (.cse0 (select |v_#memory_int_462| |v_~#y~0.base_230|))) (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_29| 0)) (= v_~y$r_buff0_thd0~0_106 v_~y$r_buff1_thd0~0_117) (= v_~y$r_buff0_thd1~0_45 v_~y$r_buff1_thd1~0_49) (= v_~y$r_buff0_thd2~0_168 v_~y$r_buff1_thd2~0_138) (= (store |v_#memory_int_462| |v_~#y~0.base_230| (store .cse0 |v_~#y~0.offset_230| |v_P2_#t~ite24_61|)) |v_#memory_int_461|) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_256) v_~y$r_buff0_thd3~0_255) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_29| (ite .cse2 1 0)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_427 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_255 256) 0)) .cse4)) 0 v_~y$r_buff0_thd3~0_256) v_~y$r_buff1_thd3~0_259) (= v_~y$w_buff1~0_240 v_~y$w_buff0~0_260) (= v_~y$w_buff1_used~0_427 (ite (or (and .cse3 (not .cse2)) .cse1) 0 v_~y$w_buff0_used~0_456)) (or (and .cse5 (= |v_P2_#t~ite23_61| |v_P2_#t~mem22_66|) (= |v_P2_#t~ite24_61| |v_P2_#t~ite23_61|) (= (select .cse0 |v_~#y~0.offset_230|) |v_P2_#t~mem22_66|)) (and (= |v_P2_#t~ite23_61| |v_P2Thread1of1ForFork0_#t~ite23_72|) (= |v_P2Thread1of1ForFork0_#t~mem22_72| |v_P2_#t~mem22_66|) (= |v_P2_#t~ite24_61| v_~y$w_buff0~0_259) .cse3)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_29| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_29|) (= v_~y$r_buff0_thd2~0_167 1) (= v_~y$w_buff0~0_259 1) (= v_~y$w_buff0_used~0_454 (ite .cse3 0 1)))))) InVars {~#y~0.offset=|v_~#y~0.offset_230|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_456, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_256, ~y$w_buff0~0=v_~y$w_buff0~0_260, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_72|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_168, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, #memory_int=|v_#memory_int_462|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_72|, ~#y~0.base=|v_~#y~0.base_230|} OutVars{~#y~0.offset=|v_~#y~0.offset_230|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_454, ~#y~0.base=|v_~#y~0.base_230|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_138, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_240, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_255, ~y$w_buff0~0=v_~y$w_buff0~0_259, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_106, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_167, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, #memory_int=|v_#memory_int_461|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_117, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_427} AuxVars[|v_P2_#t~ite23_61|, |v_P2_#t~mem22_66|, |v_P2_#t~ite24_61|] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$r_buff0_thd2~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [627] L790-->L797: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_194 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_189 256) 0)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_193 256) 0))) (.cse1 (not .cse10))) (let ((.cse4 (and .cse6 .cse1)) (.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse5 (select |v_#memory_int_169| |v_~#y~0.base_112|)) (.cse0 (not .cse11))) (and (= v_~y$w_buff0_used~0_193 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_194)) (= v_~y$w_buff1_used~0_188 (ite (or (and .cse2 .cse3) .cse4) 0 v_~y$w_buff1_used~0_189)) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_50) v_~y$r_buff0_thd2~0_49) (= (store |v_#memory_int_169| |v_~#y~0.base_112| (store .cse5 |v_~#y~0.offset_112| |v_P1_#t~ite5#1_27|)) |v_#memory_int_168|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_49 256) 0)))) 0 v_~y$r_buff1_thd2~0_43) v_~y$r_buff1_thd2~0_42) (let ((.cse7 (= |v_P1Thread1of1ForFork2_#t~mem3#1_1| |v_P1_#t~mem3#1_36|))) (or (and (or (and .cse2 (= |v_P1_#t~ite4#1_29| v_~y$w_buff1~0_82) .cse7 .cse3) (and (= (select .cse5 |v_~#y~0.offset_112|) |v_P1_#t~mem3#1_36|) (or .cse8 .cse9) (= |v_P1_#t~ite4#1_29| |v_P1_#t~mem3#1_36|))) (or .cse10 .cse11) (= |v_P1_#t~ite4#1_29| |v_P1_#t~ite5#1_27|)) (and .cse0 (= |v_P1_#t~ite5#1_27| v_~y$w_buff0~0_77) (= |v_P1_#t~ite4#1_29| |v_P1Thread1of1ForFork2_#t~ite4#1_1|) .cse1 .cse7))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, #memory_int=|v_#memory_int_169|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_1|, ~#y~0.base=|v_~#y~0.base_112|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_193, ~y$w_buff1~0=v_~y$w_buff1~0_82, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, #memory_int=|v_#memory_int_168|, ~#y~0.base=|v_~#y~0.base_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[|v_P1_#t~ite4#1_29|, |v_P1_#t~ite5#1_27|, |v_P1_#t~mem3#1_36|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-06 06:39:10,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [760] $Ultimate##0-->L833: Formula: (let ((.cse37 (mod v_~y$w_buff0_used~0_450 256)) (.cse38 (mod v_~weak$$choice0~0_117 256))) (let ((.cse24 (= .cse38 0)) (.cse32 (= .cse37 0)) (.cse26 (= (mod v_~y$w_buff1_used~0_423 256) 0)) (.cse28 (= (mod v_~y$r_buff0_thd3~0_251 256) 0)) (.cse10 (= (mod v_~weak$$choice2~0_90 256) 0))) (let ((.cse9 (not .cse10)) (.cse29 (not .cse28)) (.cse19 (not .cse26)) (.cse31 (not .cse32)) (.cse25 (= (mod v_~y$r_buff1_thd3~0_255 256) 0)) (.cse22 (= (mod v_~weak$$choice1~0_142 256) 0)) (.cse20 (not .cse24))) (let ((.cse12 (ite (= (ite .cse9 .cse37 (ite .cse32 .cse37 (ite (and .cse29 .cse31) 0 (ite (and .cse19 .cse28 .cse31 .cse25) (ite (or .cse22 .cse20) 1 0) .cse38)))) 0) 0 1))) (let ((.cse6 (= (mod .cse12 256) 0))) (let ((.cse8 (not .cse6))) (let ((.cse36 (and .cse29 .cse8))) (let ((.cse14 (ite .cse9 v_~y$w_buff1_used~0_423 (ite .cse6 v_~y$w_buff1_used~0_423 (ite .cse36 0 (ite (and .cse8 .cse19 .cse28 .cse25) v_~weak$$choice0~0_117 0)))))) (let ((.cse1 (= (mod .cse14 256) 0))) (let ((.cse2 (not .cse1))) (let ((.cse15 (ite .cse9 v_~y$r_buff0_thd3~0_251 (ite .cse6 v_~y$r_buff0_thd3~0_251 (ite .cse36 0 (ite (and .cse2 .cse8 .cse28 .cse25) v_~y$r_buff0_thd3~0_251 0)))))) (let ((.cse5 (= (mod .cse15 256) 0))) (let ((.cse7 (not .cse5))) (let ((.cse11 (and .cse7 .cse8))) (let ((.cse34 (ite .cse9 v_~y$r_buff1_thd3~0_255 (ite .cse6 v_~y$r_buff1_thd3~0_255 (ite .cse11 0 (ite (and .cse2 .cse5 .cse8 .cse25) (ite .cse20 v_~y$r_buff1_thd3~0_255 0) 0)))))) (let ((.cse35 (select |v_#memory_int_457| |v_~#y~0.base_228|)) (.cse0 (= (mod .cse34 256) 0)) (.cse33 (not (= (mod v_~y$w_buff0_used~0_448 256) 0)))) (let ((.cse13 (and .cse7 .cse33)) (.cse3 (not .cse0)) (.cse21 (select .cse35 |v_~#y~0.offset_228|))) (and (let ((.cse4 (= |v_P2Thread1of1ForFork0_#t~mem22_68| |v_P2_#t~mem22_63|))) (or (and (or (and (= |v_P2_#t~ite23_58| |v_P2_#t~mem22_63|) (or .cse0 .cse1) (= |v_P2_#t~ite21_55| |v_P2_#t~mem22_63|)) (and .cse2 .cse3 .cse4 (= v_~y$w_buff1~0_236 |v_P2_#t~ite23_58|))) (= |v_P2_#t~ite24_58| |v_P2_#t~ite23_58|) (or .cse5 .cse6)) (and .cse7 .cse8 (= |v_P2_#t~ite24_58| v_~y$w_buff0~0_255) .cse4 (= |v_P2_#t~ite23_58| |v_P2Thread1of1ForFork0_#t~ite23_68|)))) (or (and .cse9 (= |v_P2Thread1of1ForFork0_#t~mem20_50| |v_P2_#t~mem20_60|) (= |v_P2_#t~ite21_55| v_~y$mem_tmp~0_54)) (and .cse10 (= |v_P2_#t~mem20_60| v_~__unbuffered_p2_EAX~0_143) (= |v_P2_#t~ite21_55| |v_P2_#t~mem20_60|))) (= v_~z~0_47 v_~__unbuffered_p0_EAX~0_75) (= v_~y$w_buff0_used~0_448 (ite .cse11 0 .cse12)) (= v_~weak$$choice1~0_142 |v_P2Thread1of1ForFork0_#t~nondet9_50|) (= (ite (or (and .cse2 .cse3) .cse13) 0 .cse14) v_~y$w_buff1_used~0_421) (= |v_~#y~0.offset_228| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_102) (= (ite .cse13 0 .cse15) v_~y$r_buff0_thd3~0_249) (= v_~weak$$choice2~0_90 |v_P2Thread1of1ForFork0_#t~nondet7_50|) (= v_~__unbuffered_p2_EAX$read_delayed~0_97 1) (= 0 v_~y$flush_delayed~0_78) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~y$w_buff0~0_256 v_~y$w_buff0~0_255) (let ((.cse16 (= |v_P2Thread1of1ForFork0_#t~mem13_50| |v_P2_#t~mem13_96|)) (.cse17 (= |v_P2_#t~ite15_75| |v_P2Thread1of1ForFork0_#t~ite15_50|)) (.cse18 (= |v_P2_#t~ite14_93| |v_P2Thread1of1ForFork0_#t~ite14_50|)) (.cse27 (= |v_P2_#t~ite12_79| |v_P2Thread1of1ForFork0_#t~ite12_50|)) (.cse23 (= |v_P2Thread1of1ForFork0_#t~mem11_50| |v_P2_#t~mem11_80|)) (.cse30 (= |v_P2_#t~ite16_73| |v_P2Thread1of1ForFork0_#t~ite16_50|))) (or (and (= |v_P2Thread1of1ForFork0_#t~mem10_50| |v_P2_#t~mem10_60|) (= |v_P2_#t~ite17_63| v_~__unbuffered_p2_EAX~0_143) (or (and (or (and .cse16 .cse17 .cse18 .cse19 (or (and .cse20 (= |v_P2_#t~ite12_79| |v_P2_#t~mem11_80|) (= .cse21 |v_P2_#t~mem11_80|)) (and (= |v_P2_#t~ite12_79| (ite (not .cse22) v_~y$w_buff0~0_256 v_~y$w_buff1~0_237)) .cse23 .cse24)) (= |v_P2_#t~ite16_73| |v_P2_#t~ite12_79|) .cse25) (and (or (not .cse25) .cse26) .cse27 .cse23 (or (and .cse16 (= |v_P2_#t~ite15_75| (ite .cse20 v_~y$w_buff1~0_237 v_~y$w_buff0~0_256)) .cse18 .cse19) (and .cse26 (= |v_P2_#t~ite15_75| |v_P2_#t~ite14_93|) (or (and .cse16 .cse20 (= |v_P2_#t~ite14_93| v_~y$w_buff0~0_256)) (and (= .cse21 |v_P2_#t~mem13_96|) (= |v_P2_#t~ite14_93| |v_P2_#t~mem13_96|) .cse24)))) (= |v_P2_#t~ite15_75| |v_P2_#t~ite16_73|))) (= |v_P2_#t~ite16_73| |v_P2_#t~ite17_63|) .cse28) (and (= |v_P2_#t~ite17_63| v_~y$w_buff0~0_256) .cse29 .cse16 .cse17 .cse18 .cse27 .cse23 .cse30)) .cse31) (and .cse16 (= |v_P2_#t~ite17_63| |v_P2Thread1of1ForFork0_#t~ite17_50|) .cse17 .cse18 (= |v_P2_#t~mem10_60| v_~__unbuffered_p2_EAX~0_143) .cse27 .cse23 (= .cse21 |v_P2_#t~mem10_60|) .cse30 .cse32))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_249 256) 0)) .cse33) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_421 256) 0)))) 0 .cse34) v_~y$r_buff1_thd3~0_253) (= v_~z~0_47 1) (= v_~weak$$choice0~0_117 |v_P2Thread1of1ForFork0_#t~nondet6_50|) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_102 |v_~#y~0.base_228|) (= v_~y$mem_tmp~0_54 .cse21) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= (store |v_#memory_int_457| |v_~#y~0.base_228| (store .cse35 |v_~#y~0.offset_228| |v_P2_#t~ite24_58|)) |v_#memory_int_455|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~y$w_buff1~0_237 v_~y$w_buff1~0_236) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|))))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_228|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_450, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_50|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_50|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_50|, ~#y~0.base=|v_~#y~0.base_228|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_255, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_251, ~y$w_buff0~0=v_~y$w_buff0~0_256, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_68|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_50|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_50|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_50|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_50|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_50|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_50|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_50|, ~y$w_buff1~0=v_~y$w_buff1~0_237, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_50|, #memory_int=|v_#memory_int_457|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_68|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_423, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_50|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_27|, ~#y~0.offset=|v_~#y~0.offset_228|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_448, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_102, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_102, ~#y~0.base=|v_~#y~0.base_228|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_75, ~y$mem_tmp~0=v_~y$mem_tmp~0_54, ~weak$$choice1~0=v_~weak$$choice1~0_142, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_253, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_27|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_249, ~y$w_buff0~0=v_~y$w_buff0~0_255, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_36|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_143, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_27|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_97, ~weak$$choice0~0=v_~weak$$choice0~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_236, #memory_int=|v_#memory_int_455|, ~z~0=v_~z~0_47, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_27|, ~weak$$choice2~0=v_~weak$$choice2~0_90, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_421} AuxVars[|v_P2_#t~mem11_80|, |v_P2_#t~ite21_55|, |v_P2_#t~mem10_60|, |v_P2_#t~ite24_58|, |v_P2_#t~mem13_96|, |v_P2_#t~mem22_63|, |v_P2_#t~ite17_63|, |v_P2_#t~ite16_73|, |v_P2_#t~mem20_60|, |v_P2_#t~ite14_93|, |v_P2_#t~ite23_58|, |v_P2_#t~ite12_79|, |v_P2_#t~ite15_75|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [619] L763-->L766: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-06 06:39:14,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->L766: Formula: (let ((.cse7 (= (mod v_~y$r_buff0_thd3~0_286 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_520 256) 0)) (.cse10 (mod v_~weak$$choice0~0_121 256)) (.cse1 (mod v_~y$w_buff0_used~0_521 256))) (let ((.cse18 (select |v_#memory_int_516| |v_~#y~0.base_256|)) (.cse2 (= .cse1 0)) (.cse26 (= (mod v_~y$w_buff1_used~0_474 256) 0)) (.cse25 (= .cse10 0)) (.cse14 (not .cse12)) (.cse4 (not .cse7)) (.cse16 (= (mod v_~weak$$choice2~0_94 256) 0))) (let ((.cse0 (not .cse16)) (.cse17 (and .cse14 .cse4)) (.cse15 (not (= (mod v_~y$w_buff1_used~0_473 256) 0))) (.cse5 (= (mod v_~y$r_buff1_thd3~0_286 256) 0)) (.cse9 (= (mod v_~weak$$choice1~0_146 256) 0)) (.cse8 (not .cse25)) (.cse6 (not .cse26)) (.cse3 (not .cse2)) (.cse11 (select .cse18 |v_~#y~0.offset_256|))) (and (= |v_~#y~0.offset_256| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_106) (= v_~y$w_buff1~0_271 v_~y$w_buff1~0_270) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~y$w_buff0~0_309 v_~y$w_buff0~0_310) (= 0 v_~y$flush_delayed~0_82) (= v_~__unbuffered_p2_EAX$read_delayed~0_101 1) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_51 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (= (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse5 .cse6 .cse7 .cse3) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1) v_~y$w_buff0_used~0_520) (= v_~y$mem_tmp~0_58 .cse11) (= (ite .cse0 v_~y$r_buff1_thd3~0_286 (ite .cse12 v_~y$r_buff1_thd3~0_286 (let ((.cse13 (= (mod v_~y$r_buff0_thd3~0_285 256) 0))) (ite (and (not .cse13) .cse14) 0 (ite (and .cse5 .cse13 .cse15 .cse14) (ite .cse8 v_~y$r_buff1_thd3~0_286 0) 0))))) v_~y$r_buff1_thd3~0_285) (= v_~weak$$choice2~0_94 |v_P2Thread1of1ForFork0_#t~nondet7_58|) (= v_~z~0_51 v_~__unbuffered_p0_EAX~0_79) (or (and (= |v_P2_#t~ite21_66| v_~y$mem_tmp~0_58) (= |v_P2Thread1of1ForFork0_#t~mem20_58| |v_P2_#t~mem20_71|) .cse0) (and .cse16 (= |v_P2_#t~ite21_66| |v_P2_#t~mem20_71|) (= |v_P2_#t~mem20_71| v_~__unbuffered_p2_EAX~0_147))) (= v_~y$w_buff1_used~0_473 (ite .cse0 v_~y$w_buff1_used~0_474 (ite .cse12 v_~y$w_buff1_used~0_474 (ite .cse17 0 (ite (and .cse5 .cse6 .cse7 .cse14) v_~weak$$choice0~0_121 0))))) (= v_~weak$$choice0~0_121 |v_P2Thread1of1ForFork0_#t~nondet6_58|) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (= (store |v_#memory_int_516| |v_~#y~0.base_256| (store .cse18 |v_~#y~0.offset_256| |v_P2_#t~ite21_66|)) |v_#memory_int_515|) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_106 |v_~#y~0.base_256|) (= (ite .cse0 v_~y$r_buff0_thd3~0_286 (ite .cse12 v_~y$r_buff0_thd3~0_286 (ite .cse17 0 (ite (and .cse5 .cse7 .cse15 .cse14) v_~y$r_buff0_thd3~0_286 0)))) v_~y$r_buff0_thd3~0_285) (= v_~weak$$choice1~0_146 |v_P2Thread1of1ForFork0_#t~nondet9_58|) (= v_~__unbuffered_p0_EBX~0_73 v_~x~0_50) (let ((.cse19 (= |v_P2_#t~ite12_90| |v_P2Thread1of1ForFork0_#t~ite12_58|)) (.cse20 (= |v_P2Thread1of1ForFork0_#t~mem13_58| |v_P2_#t~mem13_107|)) (.cse21 (= |v_P2_#t~ite16_84| |v_P2Thread1of1ForFork0_#t~ite16_58|)) (.cse22 (= |v_P2Thread1of1ForFork0_#t~mem11_58| |v_P2_#t~mem11_91|)) (.cse23 (= |v_P2_#t~ite15_86| |v_P2Thread1of1ForFork0_#t~ite15_58|)) (.cse24 (= |v_P2Thread1of1ForFork0_#t~ite14_58| |v_P2_#t~ite14_104|))) (or (and (or (and .cse19 (= |v_P2_#t~ite17_74| v_~y$w_buff0~0_310) .cse20 .cse21 .cse22 .cse23 .cse4 .cse24) (and .cse7 (= |v_P2_#t~ite16_84| |v_P2_#t~ite17_74|) (or (and .cse19 (= |v_P2_#t~ite15_86| |v_P2_#t~ite16_84|) .cse22 (or (and .cse20 .cse6 (= |v_P2_#t~ite15_86| (ite .cse8 v_~y$w_buff1~0_271 v_~y$w_buff0~0_310)) .cse24) (and (or (and .cse20 .cse8 (= v_~y$w_buff0~0_310 |v_P2_#t~ite14_104|)) (and (= .cse11 |v_P2_#t~mem13_107|) .cse25 (= |v_P2_#t~mem13_107| |v_P2_#t~ite14_104|))) (= |v_P2_#t~ite15_86| |v_P2_#t~ite14_104|) .cse26)) (or .cse26 (not .cse5))) (and .cse5 (or (and (= |v_P2_#t~ite12_90| (ite (not .cse9) v_~y$w_buff0~0_310 v_~y$w_buff1~0_271)) .cse22 .cse25) (and (= |v_P2_#t~ite12_90| |v_P2_#t~mem11_91|) (= |v_P2_#t~mem11_91| .cse11) .cse8)) .cse20 .cse6 .cse23 (= |v_P2_#t~ite16_84| |v_P2_#t~ite12_90|) .cse24)))) (= |v_P2_#t~ite17_74| v_~__unbuffered_p2_EAX~0_147) (= |v_P2Thread1of1ForFork0_#t~mem10_58| |v_P2_#t~mem10_71|) .cse3) (and .cse19 (= |v_P2_#t~mem10_71| v_~__unbuffered_p2_EAX~0_147) .cse20 (= |v_P2_#t~ite17_74| |v_P2Thread1of1ForFork0_#t~ite17_58|) .cse21 .cse22 .cse23 (= |v_P2_#t~mem10_71| .cse11) .cse24 .cse2))))))) InVars {~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_521, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_58|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_58|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_58|, ~#y~0.base=|v_~#y~0.base_256|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_286, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_286, ~y$w_buff0~0=v_~y$w_buff0~0_310, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_58|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_58|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_58|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_58|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_58|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_58|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_58|, ~y$w_buff1~0=v_~y$w_buff1~0_271, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_58|, #memory_int=|v_#memory_int_516|, ~x~0=v_~x~0_50, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_474, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_58|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_31|, ~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_520, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_106, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_106, ~#y~0.base=|v_~#y~0.base_256|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_146, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_285, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_31|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_285, ~y$w_buff0~0=v_~y$w_buff0~0_309, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_147, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_73, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_101, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_270, #memory_int=|v_#memory_int_515|, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_31|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~x~0=v_~x~0_50, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_473} AuxVars[|v_P2_#t~mem13_107|, |v_P2_#t~mem11_91|, |v_P2_#t~ite14_104|, |v_P2_#t~ite17_74|, |v_P2_#t~ite16_84|, |v_P2_#t~mem20_71|, |v_P2_#t~ite12_90|, |v_P2_#t~ite21_66|, |v_P2_#t~mem10_71|, |v_P2_#t~ite15_86|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, ~__unbuffered_p0_EBX~0, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [770] $Ultimate##0-->L797: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_274 256) 0))) (let ((.cse4 (not .cse9))) (let ((.cse10 (ite .cse4 0 1))) (let ((.cse7 (= (mod .cse10 256) 0))) (let ((.cse5 (not .cse7))) (let ((.cse11 (and .cse5 .cse4)) (.cse8 (= (mod v_~y$w_buff0_used~0_501 256) 0))) (let ((.cse3 (ite (or .cse11 (and (not .cse8) .cse4)) 0 v_~y$w_buff0_used~0_501))) (let ((.cse0 (not (= (mod .cse3 256) 0))) (.cse1 (not (= (mod v_~y$r_buff0_thd2~0_202 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_500 256) 0))) (.cse6 (select |v_#memory_int_496| |v_~#y~0.base_246|))) (and (= v_~y$w_buff1~0_258 v_~y$w_buff0~0_292) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_17| |v_P1Thread1of1ForFork2_~arg#1.offset_17|) (= (ite (or (and .cse0 .cse1) .cse2) 0 .cse3) v_~y$w_buff1_used~0_459) (= (ite .cse2 0 1) v_~y$r_buff0_thd2~0_201) (= (ite (or (and .cse0 .cse4) (and (not (= (mod v_~y$r_buff0_thd3~0_273 256) 0)) .cse5)) 0 v_~y$r_buff0_thd3~0_274) v_~y$r_buff1_thd3~0_275) (= (store |v_#memory_int_496| |v_~#y~0.base_246| (store .cse6 |v_~#y~0.offset_246| |v_P1_#t~ite5#1_64|)) |v_#memory_int_495|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_459 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_201 256) 0)))) 0 v_~y$r_buff0_thd2~0_202) v_~y$r_buff1_thd2~0_158) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_43| 0)) (= v_~x~0_42 1) (= v_~y$r_buff0_thd0~0_132 v_~y$r_buff1_thd0~0_141) (= v_~y$w_buff0~0_291 1) (= v_~y$r_buff0_thd1~0_59 v_~y$r_buff1_thd1~0_63) (or (and (= |v_P1_#t~ite5#1_64| v_~y$w_buff0~0_291) (= |v_P1_#t~ite4#1_66| |v_P1Thread1of1ForFork2_#t~ite4#1_70|) .cse5 (= |v_P1Thread1of1ForFork2_#t~mem3#1_70| |v_P1_#t~mem3#1_73|)) (and (= |v_P2_#t~ite24_71| |v_P1_#t~mem3#1_73|) (= |v_P1_#t~ite4#1_66| |v_P1_#t~ite5#1_64|) (= |v_P1_#t~ite4#1_66| |v_P1_#t~mem3#1_73|) .cse7)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_43| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_43|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_43| (ite .cse8 1 0)) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_17| |v_P1Thread1of1ForFork2_~arg#1.base_17|) (or (and (= |v_P2Thread1of1ForFork0_#t~mem22_80| |v_P2_#t~mem22_76|) (= |v_P2_#t~ite23_71| |v_P2Thread1of1ForFork0_#t~ite23_80|) (= |v_P2_#t~ite24_71| v_~y$w_buff0~0_291) .cse4) (and (= (select .cse6 |v_~#y~0.offset_246|) |v_P2_#t~mem22_76|) (= |v_P2_#t~ite23_71| |v_P2_#t~mem22_76|) (= |v_P2_#t~ite24_71| |v_P2_#t~ite23_71|) .cse9)) (= v_~y$w_buff0_used~0_500 (ite .cse5 0 .cse10)) (= (ite .cse11 0 v_~y$r_buff0_thd3~0_274) v_~y$r_buff0_thd3~0_273)))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_246|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_501, ~#y~0.base=|v_~#y~0.base_246|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_17|, ~y$w_buff0~0=v_~y$w_buff0~0_292, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_274, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_80|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_202, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_59, #memory_int=|v_#memory_int_496|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_80|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_70|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_70|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_17|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_17|, ~#y~0.offset=|v_~#y~0.offset_246|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_500, ~#y~0.base=|v_~#y~0.base_246|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_63, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_275, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_37|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_43|, ~y$w_buff0~0=v_~y$w_buff0~0_291, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_273, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_42|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_59, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_17|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_17|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_43|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_158, ~y$w_buff1~0=v_~y$w_buff1~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_201, #memory_int=|v_#memory_int_495|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_141, ~x~0=v_~x~0_42, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_459} AuxVars[|v_P1_#t~ite4#1_66|, |v_P1_#t~ite5#1_64|, |v_P1_#t~mem3#1_73|, |v_P2_#t~mem22_76|, |v_P2_#t~ite23_71|, |v_P2_#t~ite24_71|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$r_buff0_thd2~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-06 06:39:18,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->L766: Formula: (let ((.cse7 (= (mod v_~y$r_buff0_thd3~0_286 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_520 256) 0)) (.cse10 (mod v_~weak$$choice0~0_121 256)) (.cse1 (mod v_~y$w_buff0_used~0_521 256))) (let ((.cse18 (select |v_#memory_int_516| |v_~#y~0.base_256|)) (.cse2 (= .cse1 0)) (.cse26 (= (mod v_~y$w_buff1_used~0_474 256) 0)) (.cse25 (= .cse10 0)) (.cse14 (not .cse12)) (.cse4 (not .cse7)) (.cse16 (= (mod v_~weak$$choice2~0_94 256) 0))) (let ((.cse0 (not .cse16)) (.cse17 (and .cse14 .cse4)) (.cse15 (not (= (mod v_~y$w_buff1_used~0_473 256) 0))) (.cse5 (= (mod v_~y$r_buff1_thd3~0_286 256) 0)) (.cse9 (= (mod v_~weak$$choice1~0_146 256) 0)) (.cse8 (not .cse25)) (.cse6 (not .cse26)) (.cse3 (not .cse2)) (.cse11 (select .cse18 |v_~#y~0.offset_256|))) (and (= |v_~#y~0.offset_256| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_106) (= v_~y$w_buff1~0_271 v_~y$w_buff1~0_270) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~y$w_buff0~0_309 v_~y$w_buff0~0_310) (= 0 v_~y$flush_delayed~0_82) (= v_~__unbuffered_p2_EAX$read_delayed~0_101 1) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_51 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (= (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse5 .cse6 .cse7 .cse3) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1) v_~y$w_buff0_used~0_520) (= v_~y$mem_tmp~0_58 .cse11) (= (ite .cse0 v_~y$r_buff1_thd3~0_286 (ite .cse12 v_~y$r_buff1_thd3~0_286 (let ((.cse13 (= (mod v_~y$r_buff0_thd3~0_285 256) 0))) (ite (and (not .cse13) .cse14) 0 (ite (and .cse5 .cse13 .cse15 .cse14) (ite .cse8 v_~y$r_buff1_thd3~0_286 0) 0))))) v_~y$r_buff1_thd3~0_285) (= v_~weak$$choice2~0_94 |v_P2Thread1of1ForFork0_#t~nondet7_58|) (= v_~z~0_51 v_~__unbuffered_p0_EAX~0_79) (or (and (= |v_P2_#t~ite21_66| v_~y$mem_tmp~0_58) (= |v_P2Thread1of1ForFork0_#t~mem20_58| |v_P2_#t~mem20_71|) .cse0) (and .cse16 (= |v_P2_#t~ite21_66| |v_P2_#t~mem20_71|) (= |v_P2_#t~mem20_71| v_~__unbuffered_p2_EAX~0_147))) (= v_~y$w_buff1_used~0_473 (ite .cse0 v_~y$w_buff1_used~0_474 (ite .cse12 v_~y$w_buff1_used~0_474 (ite .cse17 0 (ite (and .cse5 .cse6 .cse7 .cse14) v_~weak$$choice0~0_121 0))))) (= v_~weak$$choice0~0_121 |v_P2Thread1of1ForFork0_#t~nondet6_58|) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (= (store |v_#memory_int_516| |v_~#y~0.base_256| (store .cse18 |v_~#y~0.offset_256| |v_P2_#t~ite21_66|)) |v_#memory_int_515|) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_106 |v_~#y~0.base_256|) (= (ite .cse0 v_~y$r_buff0_thd3~0_286 (ite .cse12 v_~y$r_buff0_thd3~0_286 (ite .cse17 0 (ite (and .cse5 .cse7 .cse15 .cse14) v_~y$r_buff0_thd3~0_286 0)))) v_~y$r_buff0_thd3~0_285) (= v_~weak$$choice1~0_146 |v_P2Thread1of1ForFork0_#t~nondet9_58|) (= v_~__unbuffered_p0_EBX~0_73 v_~x~0_50) (let ((.cse19 (= |v_P2_#t~ite12_90| |v_P2Thread1of1ForFork0_#t~ite12_58|)) (.cse20 (= |v_P2Thread1of1ForFork0_#t~mem13_58| |v_P2_#t~mem13_107|)) (.cse21 (= |v_P2_#t~ite16_84| |v_P2Thread1of1ForFork0_#t~ite16_58|)) (.cse22 (= |v_P2Thread1of1ForFork0_#t~mem11_58| |v_P2_#t~mem11_91|)) (.cse23 (= |v_P2_#t~ite15_86| |v_P2Thread1of1ForFork0_#t~ite15_58|)) (.cse24 (= |v_P2Thread1of1ForFork0_#t~ite14_58| |v_P2_#t~ite14_104|))) (or (and (or (and .cse19 (= |v_P2_#t~ite17_74| v_~y$w_buff0~0_310) .cse20 .cse21 .cse22 .cse23 .cse4 .cse24) (and .cse7 (= |v_P2_#t~ite16_84| |v_P2_#t~ite17_74|) (or (and .cse19 (= |v_P2_#t~ite15_86| |v_P2_#t~ite16_84|) .cse22 (or (and .cse20 .cse6 (= |v_P2_#t~ite15_86| (ite .cse8 v_~y$w_buff1~0_271 v_~y$w_buff0~0_310)) .cse24) (and (or (and .cse20 .cse8 (= v_~y$w_buff0~0_310 |v_P2_#t~ite14_104|)) (and (= .cse11 |v_P2_#t~mem13_107|) .cse25 (= |v_P2_#t~mem13_107| |v_P2_#t~ite14_104|))) (= |v_P2_#t~ite15_86| |v_P2_#t~ite14_104|) .cse26)) (or .cse26 (not .cse5))) (and .cse5 (or (and (= |v_P2_#t~ite12_90| (ite (not .cse9) v_~y$w_buff0~0_310 v_~y$w_buff1~0_271)) .cse22 .cse25) (and (= |v_P2_#t~ite12_90| |v_P2_#t~mem11_91|) (= |v_P2_#t~mem11_91| .cse11) .cse8)) .cse20 .cse6 .cse23 (= |v_P2_#t~ite16_84| |v_P2_#t~ite12_90|) .cse24)))) (= |v_P2_#t~ite17_74| v_~__unbuffered_p2_EAX~0_147) (= |v_P2Thread1of1ForFork0_#t~mem10_58| |v_P2_#t~mem10_71|) .cse3) (and .cse19 (= |v_P2_#t~mem10_71| v_~__unbuffered_p2_EAX~0_147) .cse20 (= |v_P2_#t~ite17_74| |v_P2Thread1of1ForFork0_#t~ite17_58|) .cse21 .cse22 .cse23 (= |v_P2_#t~mem10_71| .cse11) .cse24 .cse2))))))) InVars {~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_521, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_58|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_58|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_58|, ~#y~0.base=|v_~#y~0.base_256|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_286, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_286, ~y$w_buff0~0=v_~y$w_buff0~0_310, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_58|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_58|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_58|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_58|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_58|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_58|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_58|, ~y$w_buff1~0=v_~y$w_buff1~0_271, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_58|, #memory_int=|v_#memory_int_516|, ~x~0=v_~x~0_50, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_474, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_58|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_31|, ~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_520, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_106, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_106, ~#y~0.base=|v_~#y~0.base_256|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_146, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_285, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_31|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_285, ~y$w_buff0~0=v_~y$w_buff0~0_309, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_147, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_73, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_101, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_270, #memory_int=|v_#memory_int_515|, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_31|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~x~0=v_~x~0_50, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_473} AuxVars[|v_P2_#t~mem13_107|, |v_P2_#t~mem11_91|, |v_P2_#t~ite14_104|, |v_P2_#t~ite17_74|, |v_P2_#t~ite16_84|, |v_P2_#t~mem20_71|, |v_P2_#t~ite12_90|, |v_P2_#t~ite21_66|, |v_P2_#t~mem10_71|, |v_P2_#t~ite15_86|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, ~__unbuffered_p0_EBX~0, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [772] $Ultimate##0-->L797: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff0_thd2~0_210 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_508 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_509 256) 0))) (and (= v_~y$w_buff0~0_299 1) (= (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~y$w_buff0_used~0_509) v_~y$w_buff1_used~0_463) (= v_~y$r_buff0_thd2~0_209 (ite .cse2 0 1)) (= v_~y$w_buff0_used~0_508 0) (= v_~y$r_buff0_thd3~0_279 v_~y$r_buff1_thd3~0_279) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_47| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_47|) (= v_~y$r_buff0_thd1~0_63 v_~y$r_buff1_thd1~0_67) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_463 256) 0)) .cse0) (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_209 256) 0)))) 0 v_~y$r_buff0_thd2~0_210) v_~y$r_buff1_thd2~0_162) (= v_~y$r_buff0_thd0~0_136 v_~y$r_buff1_thd0~0_145) (= v_~y$w_buff1~0_262 v_~y$w_buff0~0_300) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_21| |v_P1Thread1of1ForFork2_~arg#1.offset_21|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_21| |v_P1Thread1of1ForFork2_~arg#1.base_21|) (= (store |v_#memory_int_504| |v_~#y~0.base_250| (store (select |v_#memory_int_504| |v_~#y~0.base_250|) |v_~#y~0.offset_250| v_~y$w_buff0~0_299)) |v_#memory_int_503|) (= v_~x~0_46 1) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_47|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_47| 0)))) InVars {~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_509, ~y$w_buff0~0=v_~y$w_buff0~0_300, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_210, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, #memory_int=|v_#memory_int_504|, ~#y~0.base=|v_~#y~0.base_250|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_21|, ~#y~0.offset=|v_~#y~0.offset_250|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_508, ~#y~0.base=|v_~#y~0.base_250|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_67, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_279, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_41|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff0~0=v_~y$w_buff0~0_299, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_279, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_63, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_75|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_21|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_75|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_47|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_262, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_209, #memory_int=|v_#memory_int_503|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_145, ~x~0=v_~x~0_46, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_463} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_#t~mem3#1, ~y$w_buff1_used~0] [2022-12-06 06:39:20,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] $Ultimate##0-->L766: Formula: (let ((.cse37 (mod v_~y$w_buff0_used~0_517 256)) (.cse38 (mod v_~weak$$choice0~0_119 256))) (let ((.cse22 (= .cse38 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_470 256) 0)) (.cse17 (= .cse37 0)) (.cse24 (= (mod v_~y$r_buff0_thd3~0_282 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_92 256) 0))) (let ((.cse4 (not .cse5)) (.cse25 (not .cse24)) (.cse18 (= (mod v_~y$r_buff1_thd3~0_282 256) 0)) (.cse26 (not .cse17)) (.cse21 (not .cse19)) (.cse23 (= (mod v_~weak$$choice1~0_144 256) 0)) (.cse20 (not .cse22))) (let ((.cse3 (ite (= (ite .cse4 .cse37 (ite .cse17 .cse37 (ite (and .cse25 .cse26) 0 (ite (and .cse24 .cse18 .cse26 .cse21) (ite (or .cse23 .cse20) 1 0) .cse38)))) 0) 0 1))) (let ((.cse30 (= (mod .cse3 256) 0))) (let ((.cse34 (not .cse30))) (let ((.cse36 (and .cse34 .cse25))) (let ((.cse28 (ite .cse4 v_~y$w_buff1_used~0_470 (ite .cse30 v_~y$w_buff1_used~0_470 (ite .cse36 0 (ite (and .cse34 .cse24 .cse18 .cse21) v_~weak$$choice0~0_119 0)))))) (let ((.cse32 (= (mod .cse28 256) 0))) (let ((.cse27 (not .cse32))) (let ((.cse1 (ite .cse4 v_~y$r_buff0_thd3~0_282 (ite .cse30 v_~y$r_buff0_thd3~0_282 (ite .cse36 0 (ite (and .cse27 .cse34 .cse24 .cse18) v_~y$r_buff0_thd3~0_282 0)))))) (let ((.cse29 (= (mod .cse1 256) 0))) (let ((.cse35 (not .cse29))) (let ((.cse2 (and .cse34 .cse35))) (let ((.cse8 (ite .cse4 v_~y$r_buff1_thd3~0_282 (ite .cse30 v_~y$r_buff1_thd3~0_282 (ite .cse2 0 (ite (and .cse27 .cse34 .cse29 .cse18) (ite .cse20 v_~y$r_buff1_thd3~0_282 0) 0)))))) (let ((.cse31 (= (mod .cse8 256) 0)) (.cse9 (select |v_#memory_int_512| |v_~#y~0.base_254|)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_516 256) 0)))) (let ((.cse0 (and .cse6 .cse35)) (.cse14 (select .cse9 |v_~#y~0.offset_254|)) (.cse7 (not .cse31))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= (ite .cse0 0 .cse1) v_~y$r_buff0_thd3~0_281) (= v_~y$w_buff0_used~0_516 (ite .cse2 0 .cse3)) (= 0 v_~y$flush_delayed~0_80) (= v_~__unbuffered_p2_EAX$read_delayed~0_99 1) (or (and (= |v_P2Thread1of1ForFork0_#t~mem20_54| |v_P2_#t~mem20_69|) (= |v_P2_#t~ite21_64| v_~y$mem_tmp~0_56) .cse4) (and (= |v_P2_#t~mem20_69| v_~__unbuffered_p2_EAX~0_145) .cse5 (= |v_P2_#t~ite21_64| |v_P2_#t~mem20_69|))) (= (ite (or (and .cse6 (not (= (mod v_~y$r_buff0_thd3~0_281 256) 0))) (and .cse7 (not (= (mod v_~y$w_buff1_used~0_469 256) 0)))) 0 .cse8) v_~y$r_buff1_thd3~0_281) (= (store |v_#memory_int_512| |v_~#y~0.base_254| (store .cse9 |v_~#y~0.offset_254| |v_P2_#t~ite24_73|)) |v_#memory_int_511|) (= v_~weak$$choice2~0_92 |v_P2Thread1of1ForFork0_#t~nondet7_54|) (let ((.cse10 (= |v_P2Thread1of1ForFork0_#t~mem13_54| |v_P2_#t~mem13_105|)) (.cse11 (= |v_P2Thread1of1ForFork0_#t~mem11_54| |v_P2_#t~mem11_89|)) (.cse12 (= |v_P2_#t~ite15_84| |v_P2Thread1of1ForFork0_#t~ite15_54|)) (.cse13 (= |v_P2_#t~ite12_88| |v_P2Thread1of1ForFork0_#t~ite12_54|)) (.cse15 (= |v_P2Thread1of1ForFork0_#t~ite14_54| |v_P2_#t~ite14_102|)) (.cse16 (= |v_P2_#t~ite16_82| |v_P2Thread1of1ForFork0_#t~ite16_54|))) (or (and .cse10 .cse11 (= |v_P2_#t~ite17_72| |v_P2Thread1of1ForFork0_#t~ite17_54|) .cse12 (= |v_P2_#t~mem10_69| v_~__unbuffered_p2_EAX~0_145) .cse13 (= |v_P2_#t~mem10_69| .cse14) .cse15 .cse16 .cse17) (and (= |v_P2Thread1of1ForFork0_#t~mem10_54| |v_P2_#t~mem10_69|) (or (and (or (and .cse11 (= |v_P2_#t~ite15_84| |v_P2_#t~ite16_82|) .cse13 (or (not .cse18) .cse19) (or (and .cse10 (= |v_P2_#t~ite15_84| (ite .cse20 v_~y$w_buff1~0_267 v_~y$w_buff0~0_306)) .cse21 .cse15) (and (= |v_P2_#t~ite15_84| |v_P2_#t~ite14_102|) (or (and (= |v_P2_#t~mem13_105| |v_P2_#t~ite14_102|) .cse22 (= |v_P2_#t~mem13_105| .cse14)) (and .cse10 (= v_~y$w_buff0~0_306 |v_P2_#t~ite14_102|) .cse20)) .cse19))) (and .cse10 .cse12 .cse18 .cse21 (or (and (= |v_P2_#t~mem11_89| .cse14) (= |v_P2_#t~ite12_88| |v_P2_#t~mem11_89|) .cse20) (and .cse11 .cse22 (= |v_P2_#t~ite12_88| (ite (not .cse23) v_~y$w_buff0~0_306 v_~y$w_buff1~0_267)))) .cse15 (= |v_P2_#t~ite16_82| |v_P2_#t~ite12_88|))) .cse24 (= |v_P2_#t~ite16_82| |v_P2_#t~ite17_72|)) (and .cse10 .cse11 .cse12 .cse25 (= |v_P2_#t~ite17_72| v_~y$w_buff0~0_306) .cse13 .cse15 .cse16)) .cse26 (= |v_P2_#t~ite17_72| v_~__unbuffered_p2_EAX~0_145)))) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= v_~y$w_buff1~0_267 v_~y$w_buff1~0_266) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_104 |v_~#y~0.base_254|) (= v_~z~0_49 v_~__unbuffered_p0_EAX~0_77) (= v_~y$w_buff1_used~0_469 (ite (or (and .cse27 .cse7) .cse0) 0 .cse28)) (= v_~__unbuffered_p0_EBX~0_71 v_~x~0_48) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~z~0_49 1) (= v_~weak$$choice1~0_144 |v_P2Thread1of1ForFork0_#t~nondet9_54|) (= |v_~#y~0.offset_254| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_104) (= v_~y$mem_tmp~0_56 .cse14) (= v_~y$w_buff0~0_306 v_~y$w_buff0~0_305) (let ((.cse33 (= |v_P2Thread1of1ForFork0_#t~mem22_84| |v_P2_#t~mem22_78|))) (or (and (or .cse29 .cse30) (or (and (= |v_P2_#t~ite23_73| |v_P2_#t~mem22_78|) (= |v_P2_#t~ite21_64| |v_P2_#t~mem22_78|) (or .cse31 .cse32)) (and .cse27 .cse33 .cse7 (= v_~y$w_buff1~0_266 |v_P2_#t~ite23_73|))) (= |v_P2_#t~ite24_73| |v_P2_#t~ite23_73|)) (and .cse34 .cse33 (= |v_P2_#t~ite23_73| |v_P2Thread1of1ForFork0_#t~ite23_84|) (= |v_P2_#t~ite24_73| v_~y$w_buff0~0_305) .cse35))) (= v_~weak$$choice0~0_119 |v_P2Thread1of1ForFork0_#t~nondet6_54|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_517, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_54|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_54|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_54|, ~#y~0.base=|v_~#y~0.base_254|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_282, ~y$w_buff0~0=v_~y$w_buff0~0_306, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_84|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_54|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_54|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_54|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_54|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_54|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_54|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_54|, ~y$w_buff1~0=v_~y$w_buff1~0_267, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_54|, #memory_int=|v_#memory_int_512|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_84|, ~x~0=v_~x~0_48, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_470, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_54|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_104, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_104, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~weak$$choice1~0=v_~weak$$choice1~0_144, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_281, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_44|, ~y$flush_delayed~0=v_~y$flush_delayed~0_80, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_145, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_71, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~weak$$choice0~0=v_~weak$$choice0~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_266, ~x~0=v_~x~0_48, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_29|, ~#y~0.offset=|v_~#y~0.offset_254|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_516, ~#y~0.base=|v_~#y~0.base_254|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_29|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_281, ~y$w_buff0~0=v_~y$w_buff0~0_305, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_29|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_99, #memory_int=|v_#memory_int_511|, ~z~0=v_~z~0_49, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_469} AuxVars[|v_P2_#t~ite24_73|, |v_P2_#t~ite23_73|, |v_P2_#t~mem13_105|, |v_P2_#t~ite14_102|, |v_P2_#t~mem20_69|, |v_P2_#t~ite21_64|, |v_P2_#t~mem22_78|, |v_P2_#t~ite15_84|, |v_P2_#t~ite16_82|, |v_P2_#t~ite17_72|, |v_P2_#t~ite12_88|, |v_P2_#t~mem10_69|, |v_P2_#t~mem11_89|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, ~__unbuffered_p0_EBX~0, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [771] $Ultimate##0-->L797: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_504 256) 0))) (.cse2 (not (= (mod v_~y$r_buff0_thd2~0_206 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_505 256) 0))) (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45| 0)) (= (ite .cse0 0 1) v_~y$r_buff0_thd2~0_205) (= v_~y$r_buff0_thd3~0_277 v_~y$r_buff1_thd3~0_277) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45| (ite .cse1 1 0)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_205 256) 0)) .cse0) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_461 256) 0)))) 0 v_~y$r_buff0_thd2~0_206) v_~y$r_buff1_thd2~0_160) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_19| |v_P1Thread1of1ForFork2_~arg#1.offset_19|) (= (ite (or .cse0 (and .cse2 (not .cse1))) 0 v_~y$w_buff0_used~0_505) v_~y$w_buff1_used~0_461) (= v_~y$w_buff0~0_295 1) (= v_~y$w_buff1~0_260 v_~y$w_buff0~0_296) (= (store |v_#memory_int_500| |v_~#y~0.base_248| (store (select |v_#memory_int_500| |v_~#y~0.base_248|) |v_~#y~0.offset_248| v_~y$w_buff0~0_295)) |v_#memory_int_499|) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_65) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45|) (= v_~y$w_buff0_used~0_504 0) (= v_~x~0_44 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_19| |v_P1Thread1of1ForFork2_~arg#1.base_19|) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_143))) InVars {~#y~0.offset=|v_~#y~0.offset_248|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_505, ~y$w_buff0~0=v_~y$w_buff0~0_296, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_206, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, #memory_int=|v_#memory_int_500|, ~#y~0.base=|v_~#y~0.base_248|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_19|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_19|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_19|, ~#y~0.offset=|v_~#y~0.offset_248|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_504, ~#y~0.base=|v_~#y~0.base_248|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_19|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_65, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_277, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_39|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45|, ~y$w_buff0~0=v_~y$w_buff0~0_295, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_73|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_19|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_73|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_19|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, ~y$w_buff1~0=v_~y$w_buff1~0_260, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_205, #memory_int=|v_#memory_int_499|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_143, ~x~0=v_~x~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_461} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_#t~mem3#1, ~y$w_buff1_used~0] [2022-12-06 06:39:23,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->L766: Formula: (let ((.cse7 (= (mod v_~y$r_buff0_thd3~0_286 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_520 256) 0)) (.cse10 (mod v_~weak$$choice0~0_121 256)) (.cse1 (mod v_~y$w_buff0_used~0_521 256))) (let ((.cse18 (select |v_#memory_int_516| |v_~#y~0.base_256|)) (.cse2 (= .cse1 0)) (.cse26 (= (mod v_~y$w_buff1_used~0_474 256) 0)) (.cse25 (= .cse10 0)) (.cse14 (not .cse12)) (.cse4 (not .cse7)) (.cse16 (= (mod v_~weak$$choice2~0_94 256) 0))) (let ((.cse0 (not .cse16)) (.cse17 (and .cse14 .cse4)) (.cse15 (not (= (mod v_~y$w_buff1_used~0_473 256) 0))) (.cse5 (= (mod v_~y$r_buff1_thd3~0_286 256) 0)) (.cse9 (= (mod v_~weak$$choice1~0_146 256) 0)) (.cse8 (not .cse25)) (.cse6 (not .cse26)) (.cse3 (not .cse2)) (.cse11 (select .cse18 |v_~#y~0.offset_256|))) (and (= |v_~#y~0.offset_256| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_106) (= v_~y$w_buff1~0_271 v_~y$w_buff1~0_270) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_~y$w_buff0~0_309 v_~y$w_buff0~0_310) (= 0 v_~y$flush_delayed~0_82) (= v_~__unbuffered_p2_EAX$read_delayed~0_101 1) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_51 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (= (ite (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite (and .cse3 .cse4) 0 (ite (and .cse5 .cse6 .cse7 .cse3) (ite (or .cse8 .cse9) 1 0) .cse10)))) 0) 0 1) v_~y$w_buff0_used~0_520) (= v_~y$mem_tmp~0_58 .cse11) (= (ite .cse0 v_~y$r_buff1_thd3~0_286 (ite .cse12 v_~y$r_buff1_thd3~0_286 (let ((.cse13 (= (mod v_~y$r_buff0_thd3~0_285 256) 0))) (ite (and (not .cse13) .cse14) 0 (ite (and .cse5 .cse13 .cse15 .cse14) (ite .cse8 v_~y$r_buff1_thd3~0_286 0) 0))))) v_~y$r_buff1_thd3~0_285) (= v_~weak$$choice2~0_94 |v_P2Thread1of1ForFork0_#t~nondet7_58|) (= v_~z~0_51 v_~__unbuffered_p0_EAX~0_79) (or (and (= |v_P2_#t~ite21_66| v_~y$mem_tmp~0_58) (= |v_P2Thread1of1ForFork0_#t~mem20_58| |v_P2_#t~mem20_71|) .cse0) (and .cse16 (= |v_P2_#t~ite21_66| |v_P2_#t~mem20_71|) (= |v_P2_#t~mem20_71| v_~__unbuffered_p2_EAX~0_147))) (= v_~y$w_buff1_used~0_473 (ite .cse0 v_~y$w_buff1_used~0_474 (ite .cse12 v_~y$w_buff1_used~0_474 (ite .cse17 0 (ite (and .cse5 .cse6 .cse7 .cse14) v_~weak$$choice0~0_121 0))))) (= v_~weak$$choice0~0_121 |v_P2Thread1of1ForFork0_#t~nondet6_58|) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (= (store |v_#memory_int_516| |v_~#y~0.base_256| (store .cse18 |v_~#y~0.offset_256| |v_P2_#t~ite21_66|)) |v_#memory_int_515|) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_106 |v_~#y~0.base_256|) (= (ite .cse0 v_~y$r_buff0_thd3~0_286 (ite .cse12 v_~y$r_buff0_thd3~0_286 (ite .cse17 0 (ite (and .cse5 .cse7 .cse15 .cse14) v_~y$r_buff0_thd3~0_286 0)))) v_~y$r_buff0_thd3~0_285) (= v_~weak$$choice1~0_146 |v_P2Thread1of1ForFork0_#t~nondet9_58|) (= v_~__unbuffered_p0_EBX~0_73 v_~x~0_50) (let ((.cse19 (= |v_P2_#t~ite12_90| |v_P2Thread1of1ForFork0_#t~ite12_58|)) (.cse20 (= |v_P2Thread1of1ForFork0_#t~mem13_58| |v_P2_#t~mem13_107|)) (.cse21 (= |v_P2_#t~ite16_84| |v_P2Thread1of1ForFork0_#t~ite16_58|)) (.cse22 (= |v_P2Thread1of1ForFork0_#t~mem11_58| |v_P2_#t~mem11_91|)) (.cse23 (= |v_P2_#t~ite15_86| |v_P2Thread1of1ForFork0_#t~ite15_58|)) (.cse24 (= |v_P2Thread1of1ForFork0_#t~ite14_58| |v_P2_#t~ite14_104|))) (or (and (or (and .cse19 (= |v_P2_#t~ite17_74| v_~y$w_buff0~0_310) .cse20 .cse21 .cse22 .cse23 .cse4 .cse24) (and .cse7 (= |v_P2_#t~ite16_84| |v_P2_#t~ite17_74|) (or (and .cse19 (= |v_P2_#t~ite15_86| |v_P2_#t~ite16_84|) .cse22 (or (and .cse20 .cse6 (= |v_P2_#t~ite15_86| (ite .cse8 v_~y$w_buff1~0_271 v_~y$w_buff0~0_310)) .cse24) (and (or (and .cse20 .cse8 (= v_~y$w_buff0~0_310 |v_P2_#t~ite14_104|)) (and (= .cse11 |v_P2_#t~mem13_107|) .cse25 (= |v_P2_#t~mem13_107| |v_P2_#t~ite14_104|))) (= |v_P2_#t~ite15_86| |v_P2_#t~ite14_104|) .cse26)) (or .cse26 (not .cse5))) (and .cse5 (or (and (= |v_P2_#t~ite12_90| (ite (not .cse9) v_~y$w_buff0~0_310 v_~y$w_buff1~0_271)) .cse22 .cse25) (and (= |v_P2_#t~ite12_90| |v_P2_#t~mem11_91|) (= |v_P2_#t~mem11_91| .cse11) .cse8)) .cse20 .cse6 .cse23 (= |v_P2_#t~ite16_84| |v_P2_#t~ite12_90|) .cse24)))) (= |v_P2_#t~ite17_74| v_~__unbuffered_p2_EAX~0_147) (= |v_P2Thread1of1ForFork0_#t~mem10_58| |v_P2_#t~mem10_71|) .cse3) (and .cse19 (= |v_P2_#t~mem10_71| v_~__unbuffered_p2_EAX~0_147) .cse20 (= |v_P2_#t~ite17_74| |v_P2Thread1of1ForFork0_#t~ite17_58|) .cse21 .cse22 .cse23 (= |v_P2_#t~mem10_71| .cse11) .cse24 .cse2))))))) InVars {~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_521, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_58|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_58|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_58|, ~#y~0.base=|v_~#y~0.base_256|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_286, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_286, ~y$w_buff0~0=v_~y$w_buff0~0_310, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_58|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_58|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_58|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_58|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_58|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_58|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_58|, ~y$w_buff1~0=v_~y$w_buff1~0_271, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_58|, #memory_int=|v_#memory_int_516|, ~x~0=v_~x~0_50, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_474, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_58|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_31|, ~#y~0.offset=|v_~#y~0.offset_256|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_520, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_106, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_106, ~#y~0.base=|v_~#y~0.base_256|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_79, ~y$mem_tmp~0=v_~y$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_146, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_285, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_31|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_285, ~y$w_buff0~0=v_~y$w_buff0~0_309, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_147, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_73, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_101, ~weak$$choice0~0=v_~weak$$choice0~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_270, #memory_int=|v_#memory_int_515|, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_31|, ~weak$$choice2~0=v_~weak$$choice2~0_94, ~x~0=v_~x~0_50, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_473} AuxVars[|v_P2_#t~mem13_107|, |v_P2_#t~mem11_91|, |v_P2_#t~ite14_104|, |v_P2_#t~ite17_74|, |v_P2_#t~ite16_84|, |v_P2_#t~mem20_71|, |v_P2_#t~ite12_90|, |v_P2_#t~ite21_66|, |v_P2_#t~mem10_71|, |v_P2_#t~ite15_86|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, ~__unbuffered_p0_EBX~0, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [771] $Ultimate##0-->L797: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_504 256) 0))) (.cse2 (not (= (mod v_~y$r_buff0_thd2~0_206 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_505 256) 0))) (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45| 0)) (= (ite .cse0 0 1) v_~y$r_buff0_thd2~0_205) (= v_~y$r_buff0_thd3~0_277 v_~y$r_buff1_thd3~0_277) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45| (ite .cse1 1 0)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_205 256) 0)) .cse0) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_461 256) 0)))) 0 v_~y$r_buff0_thd2~0_206) v_~y$r_buff1_thd2~0_160) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_19| |v_P1Thread1of1ForFork2_~arg#1.offset_19|) (= (ite (or .cse0 (and .cse2 (not .cse1))) 0 v_~y$w_buff0_used~0_505) v_~y$w_buff1_used~0_461) (= v_~y$w_buff0~0_295 1) (= v_~y$w_buff1~0_260 v_~y$w_buff0~0_296) (= (store |v_#memory_int_500| |v_~#y~0.base_248| (store (select |v_#memory_int_500| |v_~#y~0.base_248|) |v_~#y~0.offset_248| v_~y$w_buff0~0_295)) |v_#memory_int_499|) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_65) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45|) (= v_~y$w_buff0_used~0_504 0) (= v_~x~0_44 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_19| |v_P1Thread1of1ForFork2_~arg#1.base_19|) (= v_~y$r_buff0_thd0~0_134 v_~y$r_buff1_thd0~0_143))) InVars {~#y~0.offset=|v_~#y~0.offset_248|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_505, ~y$w_buff0~0=v_~y$w_buff0~0_296, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_206, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, #memory_int=|v_#memory_int_500|, ~#y~0.base=|v_~#y~0.base_248|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_19|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_19|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_19|, ~#y~0.offset=|v_~#y~0.offset_248|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_504, ~#y~0.base=|v_~#y~0.base_248|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_19|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_65, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_277, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_39|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45|, ~y$w_buff0~0=v_~y$w_buff0~0_295, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_73|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_19|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_73|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_19|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, ~y$w_buff1~0=v_~y$w_buff1~0_260, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_205, #memory_int=|v_#memory_int_499|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_143, ~x~0=v_~x~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_461} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_#t~mem3#1, ~y$w_buff1_used~0] [2022-12-06 06:39:25,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [778] $Ultimate##0-->L797: Formula: (let ((.cse25 (mod v_~y$w_buff0_used~0_536 256))) (let ((.cse26 (mod v_~weak$$choice0~0_125 256)) (.cse10 (= .cse25 0)) (.cse20 (= (mod v_~y$w_buff1_used~0_489 256) 0)) (.cse22 (= (mod v_~y$r_buff0_thd3~0_296 256) 0)) (.cse4 (= (mod v_~weak$$choice2~0_98 256) 0))) (let ((.cse5 (not .cse4)) (.cse23 (not .cse22)) (.cse17 (not .cse20)) (.cse16 (not .cse10)) (.cse19 (= (mod v_~y$r_buff1_thd3~0_297 256) 0)) (.cse18 (= (mod v_~weak$$choice1~0_152 256) 0)) (.cse21 (not (= .cse26 0)))) (let ((.cse3 (ite (= (ite .cse5 .cse25 (ite .cse10 .cse25 (ite (and .cse23 .cse16) 0 (ite (and .cse17 .cse16 .cse22 .cse19) (ite (or .cse18 .cse21) 1 0) .cse26)))) 0) 0 1))) (let ((.cse8 (= 0 (mod .cse3 256))) (.cse7 (select |v_#memory_int_531| |v_~#y~0.base_262|))) (let ((.cse0 (not (= (mod v_~y$r_buff0_thd2~0_218 256) 0))) (.cse2 (not (= 0 (mod v_~y$w_buff0_used~0_534 256)))) (.cse6 (select .cse7 |v_~#y~0.offset_262|)) (.cse1 (not .cse8))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 .cse3) v_~y$w_buff1_used~0_487) (= v_~y$w_buff0_used~0_534 0) (= v_~x~0_56 1) (or (and (= |v_P2_#t~ite21_70| |v_P2_#t~mem20_75|) (= |v_P2_#t~mem20_75| v_~__unbuffered_p2_EAX~0_155) .cse4) (and .cse5 (= |v_P2Thread1of1ForFork0_#t~mem20_66| |v_P2_#t~mem20_75|) (= |v_P2_#t~ite21_70| v_~y$mem_tmp~0_62))) (= v_~weak$$choice0~0_125 |v_P2Thread1of1ForFork0_#t~nondet6_66|) (= v_~y$mem_tmp~0_62 .cse6) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_51| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_51|) (= |v_P2Thread1of1ForFork0_#in~arg.base_35| v_P2Thread1of1ForFork0_~arg.base_35) (= |v_P2Thread1of1ForFork0_#in~arg.offset_35| v_P2Thread1of1ForFork0_~arg.offset_35) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_51| 0)) (= v_~weak$$choice2~0_98 |v_P2Thread1of1ForFork0_#t~nondet7_66|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_25| |v_P1Thread1of1ForFork2_~arg#1.base_25|) (= |v_#memory_int_529| (store |v_#memory_int_531| |v_~#y~0.base_262| (store .cse7 |v_~#y~0.offset_262| v_~y$w_buff0~0_321))) (= v_~y$r_buff0_thd1~0_67 v_~y$r_buff1_thd1~0_71) (= v_~weak$$choice1~0_152 |v_P2Thread1of1ForFork0_#t~nondet9_66|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_51| (ite .cse8 1 0)) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_487 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_217 256) 0)) .cse2)) 0 v_~y$r_buff0_thd2~0_218) v_~y$r_buff1_thd2~0_166) (= (ite .cse2 0 1) v_~y$r_buff0_thd2~0_217) (= 0 v_~y$flush_delayed~0_86) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~__unbuffered_p0_EBX~0_79 v_~x~0_57) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_25| |v_P1Thread1of1ForFork2_~arg#1.offset_25|) (= v_~y$r_buff0_thd3~0_295 v_~y$r_buff1_thd3~0_295) (= v_~z~0_55 v_~__unbuffered_p0_EAX~0_85) (= |v_~#y~0.offset_262| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_112) (= v_~z~0_55 1) (= v_~y$r_buff0_thd0~0_148 v_~y$r_buff1_thd0~0_157) (let ((.cse9 (= |v_P2Thread1of1ForFork0_#t~ite14_66| |v_P2_#t~ite14_108|)) (.cse11 (= |v_P2Thread1of1ForFork0_#t~mem13_66| |v_P2_#t~mem13_111|)) (.cse12 (= |v_P2Thread1of1ForFork0_#t~mem11_66| |v_P2_#t~mem11_95|)) (.cse13 (= |v_P2_#t~ite12_94| |v_P2Thread1of1ForFork0_#t~ite12_66|)) (.cse14 (= |v_P2_#t~ite15_90| |v_P2Thread1of1ForFork0_#t~ite15_66|)) (.cse15 (= |v_P2_#t~ite16_88| |v_P2Thread1of1ForFork0_#t~ite16_66|))) (or (and (= |v_P2_#t~mem10_75| v_~__unbuffered_p2_EAX~0_155) .cse9 (= |v_P2_#t~mem10_75| .cse6) .cse10 .cse11 .cse12 (= |v_P2_#t~ite17_78| |v_P2Thread1of1ForFork0_#t~ite17_66|) .cse13 .cse14 .cse15) (and (= |v_P2_#t~ite17_78| v_~__unbuffered_p2_EAX~0_155) (= |v_P2Thread1of1ForFork0_#t~mem10_66| |v_P2_#t~mem10_75|) .cse16 (or (and (= |v_P2_#t~ite16_88| |v_P2_#t~ite17_78|) (or (and (= |v_P2_#t~ite16_88| |v_P2_#t~ite12_94|) .cse9 .cse17 (= |v_P2_#t~ite12_94| (ite (not .cse18) v_~y$w_buff0~0_323 v_~y$w_buff1~0_284)) .cse11 .cse12 .cse14 .cse19) (and .cse12 (or (not .cse19) .cse20) .cse13 (or (and (= |v_P2_#t~ite15_90| |v_P2_#t~ite14_108|) (= |v_P2_#t~mem13_111| |v_P2_#t~ite14_108|) .cse20 (= |v_P2_#t~mem13_111| .cse6)) (and .cse9 .cse17 .cse11 (= |v_P2_#t~ite15_90| (ite .cse21 v_~y$w_buff1~0_284 v_~y$w_buff0~0_323)))) (= |v_P2_#t~ite15_90| |v_P2_#t~ite16_88|))) .cse22) (and .cse9 .cse11 .cse12 .cse23 .cse13 (= |v_P2_#t~ite17_78| v_~y$w_buff0~0_323) .cse14 .cse15))))) (= (ite .cse5 v_~y$r_buff0_thd3~0_296 (ite .cse8 v_~y$r_buff0_thd3~0_296 (let ((.cse24 (and .cse1 .cse23))) (ite .cse24 0 (ite (and (not (= (mod (ite .cse5 v_~y$w_buff1_used~0_489 (ite .cse8 v_~y$w_buff1_used~0_489 (ite .cse24 0 (ite (and .cse17 .cse1 .cse22 .cse19) v_~weak$$choice0~0_125 0)))) 256) 0)) .cse1 .cse22 .cse19) v_~y$r_buff0_thd3~0_296 0))))) v_~y$r_buff0_thd3~0_295) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_112 |v_~#y~0.base_262|) (= v_~y$w_buff0~0_321 1) (= v_~__unbuffered_p2_EAX$read_delayed~0_107 1) (= v_~y$w_buff1~0_282 v_~y$w_buff0~0_323)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_262|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_536, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_66|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_66|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_66|, ~#y~0.base=|v_~#y~0.base_262|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_25|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_297, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_323, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_296, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_66|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_66|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_66|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_25|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_35|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_66|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_66|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_66|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_66|, ~y$w_buff1~0=v_~y$w_buff1~0_284, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_66|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_218, #memory_int=|v_#memory_int_531|, ~x~0=v_~x~0_57, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_35|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_489, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_66|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_112, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_112, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_25|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~weak$$choice1~0=v_~weak$$choice1~0_152, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_295, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_45|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_51|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_67, ~y$flush_delayed~0=v_~y$flush_delayed~0_86, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_155, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_81|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_25|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_81|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_25|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_79, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_35|, ~weak$$choice0~0=v_~weak$$choice0~0_125, ~y$w_buff1~0=v_~y$w_buff1~0_282, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_217, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_157, ~x~0=v_~x~0_56, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_35|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_25|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_35|, ~#y~0.offset=|v_~#y~0.offset_262|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_534, ~#y~0.base=|v_~#y~0.base_262|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_71, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_35, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_35|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~y$w_buff0~0=v_~y$w_buff0~0_321, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_295, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_35|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_51|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_107, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_166, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #memory_int=|v_#memory_int_529|, ~z~0=v_~z~0_55, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_35|, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_487} AuxVars[|v_P2_#t~ite21_70|, |v_P2_#t~mem11_95|, |v_P2_#t~ite14_108|, |v_P2_#t~ite15_90|, |v_P2_#t~mem13_111|, |v_P2_#t~mem10_75|, |v_P2_#t~ite17_78|, |v_P2_#t~mem20_75|, |v_P2_#t~ite16_88|, |v_P2_#t~ite12_94|] AssignedVars[P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork2_#t~mem3#1, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, ~y$r_buff1_thd1~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~mem11, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:39:29,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [780] $Ultimate##0-->L797: Formula: (let ((.cse25 (mod v_~y$w_buff0_used~0_548 256))) (let ((.cse26 (mod v_~weak$$choice0~0_129 256)) (.cse20 (= .cse25 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_501 256) 0)) (.cse16 (= (mod v_~y$r_buff0_thd3~0_304 256) 0)) (.cse24 (= (mod v_~weak$$choice2~0_102 256) 0))) (let ((.cse22 (not .cse24)) (.cse18 (not .cse16)) (.cse12 (= 0 (mod v_~y$r_buff1_thd3~0_309 256))) (.cse11 (not .cse7)) (.cse19 (not .cse20)) (.cse15 (= (mod v_~weak$$choice1~0_156 256) 0)) (.cse8 (not (= .cse26 0)))) (let ((.cse5 (ite (= (ite .cse22 .cse25 (ite .cse20 .cse25 (ite (and .cse18 .cse19) 0 (ite (and .cse12 .cse16 .cse11 .cse19) (ite (or .cse15 .cse8) 1 0) .cse26)))) 0) 0 1))) (let ((.cse21 (= (mod .cse5 256) 0)) (.cse2 (select |v_#memory_int_543| |v_~#y~0.base_266|))) (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_546 256) 0))) (.cse3 (not (= (mod v_~y$r_buff0_thd2~0_226 256) 0))) (.cse0 (select .cse2 |v_~#y~0.offset_266|)) (.cse4 (not .cse21))) (and (= v_~y$mem_tmp~0_66 .cse0) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55|) (= 0 v_~y$flush_delayed~0_90) (= v_~weak$$choice2~0_102 |v_P2Thread1of1ForFork0_#t~nondet7_74|) (= (ite .cse1 0 1) v_~y$r_buff0_thd2~0_225) (= v_~__unbuffered_p0_EBX~0_83 v_~x~0_65) (= v_~y$w_buff1~0_294 v_~y$w_buff0~0_335) (= v_~y$r_buff0_thd0~0_152 v_~y$r_buff1_thd0~0_161) (= v_~x~0_64 1) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_116 |v_~#y~0.base_266|) (= (store |v_#memory_int_543| |v_~#y~0.base_266| (store .cse2 |v_~#y~0.offset_266| v_~y$w_buff0~0_333)) |v_#memory_int_541|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_29| |v_P1Thread1of1ForFork2_~arg#1.base_29|) (= v_~z~0_59 v_~__unbuffered_p0_EAX~0_89) (= |v_~#y~0.offset_266| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_116) (= v_~y$w_buff0~0_333 1) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= v_~z~0_59 1) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55| 0)) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd2~0_225 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_499 256) 0)) .cse3)) 0 v_~y$r_buff0_thd2~0_226) v_~y$r_buff1_thd2~0_170) (= v_~__unbuffered_p2_EAX$read_delayed~0_111 1) (= (ite (or .cse1 (and .cse4 .cse3)) 0 .cse5) v_~y$w_buff1_used~0_499) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_29| |v_P1Thread1of1ForFork2_~arg#1.offset_29|) (= v_~y$r_buff0_thd1~0_71 v_~y$r_buff1_thd1~0_75) (let ((.cse9 (= |v_P2Thread1of1ForFork0_#t~ite14_74| |v_P2_#t~ite14_112|)) (.cse6 (= |v_P2Thread1of1ForFork0_#t~mem11_74| |v_P2_#t~mem11_99|)) (.cse14 (= |v_P2_#t~ite15_94| |v_P2Thread1of1ForFork0_#t~ite15_74|)) (.cse17 (= |v_P2_#t~ite16_92| |v_P2Thread1of1ForFork0_#t~ite16_74|)) (.cse13 (= |v_P2_#t~ite12_98| |v_P2Thread1of1ForFork0_#t~ite12_74|)) (.cse10 (= |v_P2Thread1of1ForFork0_#t~mem13_74| |v_P2_#t~mem13_115|))) (or (and (= |v_P2_#t~ite17_82| v_~__unbuffered_p2_EAX~0_159) (= |v_P2Thread1of1ForFork0_#t~mem10_74| |v_P2_#t~mem10_79|) (or (and (or (and .cse6 (or (and (= |v_P2_#t~ite15_94| |v_P2_#t~ite14_112|) (= |v_P2_#t~mem13_115| |v_P2_#t~ite14_112|) .cse7 (= .cse0 |v_P2_#t~mem13_115|)) (and (= |v_P2_#t~ite15_94| (ite .cse8 v_~y$w_buff1~0_296 v_~y$w_buff0~0_335)) .cse9 .cse10 .cse11)) (or (not .cse12) .cse7) (= |v_P2_#t~ite15_94| |v_P2_#t~ite16_92|) .cse13) (and (= |v_P2_#t~ite16_92| |v_P2_#t~ite12_98|) .cse9 .cse6 .cse14 (= |v_P2_#t~ite12_98| (ite (not .cse15) v_~y$w_buff0~0_335 v_~y$w_buff1~0_296)) .cse12 .cse10 .cse11)) (= |v_P2_#t~ite16_92| |v_P2_#t~ite17_82|) .cse16) (and .cse9 .cse6 .cse14 .cse17 .cse13 (= |v_P2_#t~ite17_82| v_~y$w_buff0~0_335) .cse18 .cse10)) .cse19) (and .cse9 (= .cse0 |v_P2_#t~mem10_79|) .cse6 .cse14 .cse17 .cse13 (= |v_P2_#t~mem10_79| v_~__unbuffered_p2_EAX~0_159) .cse10 (= |v_P2_#t~ite17_82| |v_P2Thread1of1ForFork0_#t~ite17_74|) .cse20))) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= v_~y$r_buff0_thd3~0_303 v_~y$r_buff1_thd3~0_307) (= v_~y$w_buff0_used~0_546 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= v_~weak$$choice0~0_129 |v_P2Thread1of1ForFork0_#t~nondet6_74|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55| (ite .cse21 1 0)) (= (ite .cse22 v_~y$r_buff0_thd3~0_304 (ite .cse21 v_~y$r_buff0_thd3~0_304 (let ((.cse23 (and .cse18 .cse4))) (ite .cse23 0 (ite (and .cse4 .cse12 .cse16 (not (= (mod (ite .cse22 v_~y$w_buff1_used~0_501 (ite .cse21 v_~y$w_buff1_used~0_501 (ite .cse23 0 (ite (and .cse4 .cse12 .cse16 .cse11) v_~weak$$choice0~0_129 0)))) 256) 0))) v_~y$r_buff0_thd3~0_304 0))))) v_~y$r_buff0_thd3~0_303) (or (and (= |v_P2_#t~ite21_74| v_~y$mem_tmp~0_66) .cse22 (= |v_P2Thread1of1ForFork0_#t~mem20_74| |v_P2_#t~mem20_79|)) (and .cse24 (= |v_P2_#t~ite21_74| |v_P2_#t~mem20_79|) (= |v_P2_#t~mem20_79| v_~__unbuffered_p2_EAX~0_159))) (= v_~weak$$choice1~0_156 |v_P2Thread1of1ForFork0_#t~nondet9_74|)))))))) InVars {~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_548, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_74|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_74|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_74|, ~#y~0.base=|v_~#y~0.base_266|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_29|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_304, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_74|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_74|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_74|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_29|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_74|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_74|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_74|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_74|, ~y$w_buff1~0=v_~y$w_buff1~0_296, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_226, #memory_int=|v_#memory_int_543|, ~x~0=v_~x~0_65, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_501, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_74|} OutVars{~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_116, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_116, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_29|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ~y$mem_tmp~0=v_~y$mem_tmp~0_66, ~weak$$choice1~0=v_~weak$$choice1~0_156, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_307, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_49|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_55|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_71, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_159, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_85|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_29|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_85|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_29|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_83, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~weak$$choice0~0=v_~weak$$choice0~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_294, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_64, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_29|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_39|, ~#y~0.offset=|v_~#y~0.offset_266|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_546, ~#y~0.base=|v_~#y~0.base_266|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_75, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_39|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_333, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_303, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_39|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_55|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_111, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_170, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_152, #memory_int=|v_#memory_int_541|, ~z~0=v_~z~0_59, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_39|, ~weak$$choice2~0=v_~weak$$choice2~0_102, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[|v_P2_#t~ite15_94|, |v_P2_#t~mem13_115|, |v_P2_#t~ite16_92|, |v_P2_#t~ite17_82|, |v_P2_#t~ite21_74|, |v_P2_#t~mem11_99|, |v_P2_#t~mem20_79|, |v_P2_#t~ite12_98|, |v_P2_#t~ite14_112|, |v_P2_#t~mem10_79|] AssignedVars[P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P0Thread1of1ForFork1_~arg.base, ~__unbuffered_p0_EAX~0, ~y$mem_tmp~0, ~weak$$choice1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2_#t~ite5#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_p2_EAX~0, P1Thread1of1ForFork2_#t~ite4#1, P1Thread1of1ForFork2_~arg#1.offset, P2Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork2_#t~mem3#1, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~x~0, P1Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, ~y$r_buff1_thd1~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~mem11, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-06 06:39:32,025 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 06:39:32,026 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23893 [2022-12-06 06:39:32,026 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 178 flow [2022-12-06 06:39:32,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-06 06:39:32,026 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:32,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:32,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:39:32,026 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 468255804, now seen corresponding path program 1 times [2022-12-06 06:39:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:32,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288361835] [2022-12-06 06:39:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:39:32,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:39:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:39:32,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:39:32,177 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:39:32,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:39:32,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:39:32,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:39:32,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:39:32,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:39:32,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:39:32,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:39:32,184 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:32,189 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:39:32,189 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:39:32,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:39:32 BasicIcfg [2022-12-06 06:39:32,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:39:32,264 INFO L158 Benchmark]: Toolchain (without parser) took 55256.70ms. Allocated memory was 216.0MB in the beginning and 751.8MB in the end (delta: 535.8MB). Free memory was 189.9MB in the beginning and 463.4MB in the end (delta: -273.5MB). Peak memory consumption was 263.7MB. Max. memory is 8.0GB. [2022-12-06 06:39:32,265 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory is still 192.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:39:32,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.87ms. Allocated memory is still 216.0MB. Free memory was 189.7MB in the beginning and 161.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:39:32,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.40ms. Allocated memory is still 216.0MB. Free memory was 161.9MB in the beginning and 159.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:32,265 INFO L158 Benchmark]: Boogie Preprocessor took 30.59ms. Allocated memory is still 216.0MB. Free memory was 159.3MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:32,265 INFO L158 Benchmark]: RCFGBuilder took 1026.95ms. Allocated memory was 216.0MB in the beginning and 274.7MB in the end (delta: 58.7MB). Free memory was 157.2MB in the beginning and 236.5MB in the end (delta: -79.3MB). Peak memory consumption was 67.5MB. Max. memory is 8.0GB. [2022-12-06 06:39:32,266 INFO L158 Benchmark]: TraceAbstraction took 53556.14ms. Allocated memory was 274.7MB in the beginning and 751.8MB in the end (delta: 477.1MB). Free memory was 236.0MB in the beginning and 463.4MB in the end (delta: -227.4MB). Peak memory consumption was 249.7MB. Max. memory is 8.0GB. [2022-12-06 06:39:32,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory is still 192.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 586.87ms. Allocated memory is still 216.0MB. Free memory was 189.7MB in the beginning and 161.9MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.40ms. Allocated memory is still 216.0MB. Free memory was 161.9MB in the beginning and 159.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.59ms. Allocated memory is still 216.0MB. Free memory was 159.3MB in the beginning and 157.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1026.95ms. Allocated memory was 216.0MB in the beginning and 274.7MB in the end (delta: 58.7MB). Free memory was 157.2MB in the beginning and 236.5MB in the end (delta: -79.3MB). Peak memory consumption was 67.5MB. Max. memory is 8.0GB. * TraceAbstraction took 53556.14ms. Allocated memory was 274.7MB in the beginning and 751.8MB in the end (delta: 477.1MB). Free memory was 236.0MB in the beginning and 463.4MB in the end (delta: -227.4MB). Peak memory consumption was 249.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4s, 132 PlacesBefore, 35 PlacesAfterwards, 124 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1353, independent: 1297, independent conditional: 1297, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1353, independent: 1297, independent conditional: 0, independent unconditional: 1297, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1353, independent: 1297, independent conditional: 0, independent unconditional: 1297, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1353, independent: 1297, independent conditional: 0, independent unconditional: 1297, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1124, independent: 1090, independent conditional: 0, independent unconditional: 1090, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1124, independent: 1082, independent conditional: 0, independent unconditional: 1082, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 380, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1353, independent: 207, independent conditional: 0, independent unconditional: 207, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1124, unknown conditional: 0, unknown unconditional: 1124] , Statistics on independence cache: Total cache size (in pairs): 1619, Positive cache size: 1585, Positive conditional cache size: 0, Positive unconditional cache size: 1585, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 3, independent unconditional: 49, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 52, independent conditional: 3, independent unconditional: 49, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 52, independent conditional: 3, independent unconditional: 49, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 65, independent: 49, independent conditional: 3, independent unconditional: 46, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 133, dependent conditional: 16, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 65, unknown conditional: 5, unknown unconditional: 60] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 49, Positive conditional cache size: 3, Positive unconditional cache size: 46, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 42, independent conditional: 3, independent unconditional: 39, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 51, Positive conditional cache size: 3, Positive unconditional cache size: 48, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 33 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 99, independent conditional: 18, independent unconditional: 81, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 87, Positive conditional cache size: 3, Positive unconditional cache size: 84, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 33 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 197, independent: 169, independent conditional: 43, independent unconditional: 126, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, independent: 169, independent conditional: 43, independent unconditional: 126, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, independent: 169, independent conditional: 43, independent unconditional: 126, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, independent: 153, independent conditional: 37, independent unconditional: 116, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 16, unknown conditional: 6, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 116, Positive conditional cache size: 9, Positive unconditional cache size: 107, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 77, independent conditional: 26, independent unconditional: 51, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 77, independent conditional: 26, independent unconditional: 51, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 77, independent conditional: 26, independent unconditional: 51, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, independent: 74, independent conditional: 23, independent unconditional: 51, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 119, Positive conditional cache size: 12, Positive unconditional cache size: 107, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 31, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 83, independent conditional: 31, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 31, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 80, independent conditional: 29, independent unconditional: 51, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 124, Positive conditional cache size: 14, Positive unconditional cache size: 110, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 111, independent conditional: 57, independent unconditional: 54, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 111, independent conditional: 57, independent unconditional: 54, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 111, independent conditional: 57, independent unconditional: 54, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 107, independent conditional: 53, independent unconditional: 54, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 132, Positive conditional cache size: 19, Positive unconditional cache size: 113, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 141, Positive conditional cache size: 19, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 141, Positive conditional cache size: 19, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 151, Positive conditional cache size: 20, Positive unconditional cache size: 131, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.9s, 45 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 23 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 42, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 48, independent conditional: 42, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 42, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 36, independent conditional: 30, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 187, Positive conditional cache size: 33, Positive unconditional cache size: 154, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=-2, t2052={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=-1, t2052={7:0}, t2053={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 [L825] 3 z = 1 [L762] 3 __unbuffered_p0_EAX = z [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L765] 3 __unbuffered_p0_EBX = x [L777] 3 x = 1 [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 1 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd2 = (_Bool)1 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 3 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 230 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 230 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 758 IncrementalHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2 mSDtfsCounter, 758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:39:32,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...