/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/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:03:31,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:03:31,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:03:31,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:03:31,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:03:31,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:03:31,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:03:31,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:03:31,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:03:31,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:03:31,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:03:31,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:03:31,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:03:31,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:03:31,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:03:31,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:03:31,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:03:31,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:03:31,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:03:31,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:03:31,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:03:31,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:03:31,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:03:31,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:03:31,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:03:31,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:03:31,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:03:31,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:03:31,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:03:31,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:03:31,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:03:31,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:03:31,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:03:31,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:03:31,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:03:31,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:03:31,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:03:31,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:03:31,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:03:31,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:03:31,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:03:31,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:03:31,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:03:31,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:03:31,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:03:31,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:03:31,613 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:03:31,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:03:31,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:03:31,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:03:31,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:03:31,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:03:31,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:03:31,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:03:31,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:03:31,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:03:31,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:03:31,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:03:31,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:03:31,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:03:31,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:03:31,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:03:31,638 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:03:31,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:03:31,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:03:31,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:03:31,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:03:31,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:03:31,945 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:03:31,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2022-12-13 12:03:32,930 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:03:33,168 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:03:33,169 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2022-12-13 12:03:33,195 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa00a8114/84b1b94f81df461e8b61cd8cb3803952/FLAGabbe98dde [2022-12-13 12:03:33,210 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa00a8114/84b1b94f81df461e8b61cd8cb3803952 [2022-12-13 12:03:33,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:03:33,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:03:33,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:03:33,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:03:33,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:03:33,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d361773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33, skipping insertion in model container [2022-12-13 12:03:33,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:03:33,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:03:33,412 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/safe019_power.oepc.i[995,1008] [2022-12-13 12:03:33,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:03:33,618 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:03:33,627 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/safe019_power.oepc.i[995,1008] [2022-12-13 12:03:33,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:03:33,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:03:33,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:03:33,696 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:03:33,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33 WrapperNode [2022-12-13 12:03:33,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:03:33,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:03:33,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:03:33,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:03:33,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,740 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-12-13 12:03:33,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:03:33,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:03:33,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:03:33,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:03:33,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:03:33,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:03:33,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:03:33,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:03:33,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (1/1) ... [2022-12-13 12:03:33,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:03:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:03:33,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:03:33,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:03:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:03:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:03:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:03:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:03:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:03:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:03:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:03:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:03:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:03:33,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:03:33,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:03:33,837 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:03:34,006 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:03:34,008 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:03:34,456 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:03:34,721 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:03:34,721 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:03:34,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:03:34 BoogieIcfgContainer [2022-12-13 12:03:34,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:03:34,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:03:34,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:03:34,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:03:34,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:03:33" (1/3) ... [2022-12-13 12:03:34,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce5c5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:03:34, skipping insertion in model container [2022-12-13 12:03:34,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:03:33" (2/3) ... [2022-12-13 12:03:34,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce5c5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:03:34, skipping insertion in model container [2022-12-13 12:03:34,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:03:34" (3/3) ... [2022-12-13 12:03:34,732 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2022-12-13 12:03:34,746 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:03:34,746 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:03:34,748 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:03:34,795 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:03:34,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2022-12-13 12:03:34,857 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2022-12-13 12:03:34,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:03:34,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 12:03:34,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2022-12-13 12:03:34,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2022-12-13 12:03:34,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:34,877 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2022-12-13 12:03:34,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2022-12-13 12:03:34,902 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2022-12-13 12:03:34,902 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:03:34,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:03:34,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2022-12-13 12:03:34,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-13 12:03:43,595 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-13 12:03:43,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:03:43,622 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;@2e97cd14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:03:43,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 12:03:43,627 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 12:03:43,627 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:03:43,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:43,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:43,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1999036268, now seen corresponding path program 1 times [2022-12-13 12:03:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:43,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559072503] [2022-12-13 12:03:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:43,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559072503] [2022-12-13 12:03:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559072503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:43,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:43,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:03:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126665371] [2022-12-13 12:03:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:43,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:03:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:43,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:03:43,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:03:43,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 12:03:43,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:43,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:43,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 12:03:43,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:44,937 INFO L130 PetriNetUnfolder]: 4983/7065 cut-off events. [2022-12-13 12:03:44,937 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-13 12:03:44,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14057 conditions, 7065 events. 4983/7065 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 37858 event pairs, 4983 based on Foata normal form. 0/5478 useless extension candidates. Maximal degree in co-relation 14045. Up to 6785 conditions per place. [2022-12-13 12:03:44,980 INFO L137 encePairwiseOnDemand]: 35/36 looper letters, 25 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2022-12-13 12:03:44,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 132 flow [2022-12-13 12:03:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:03:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:03:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-12-13 12:03:44,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 12:03:44,989 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 46 transitions. [2022-12-13 12:03:44,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 132 flow [2022-12-13 12:03:44,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:03:44,995 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-12-13 12:03:44,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 12:03:44,999 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-13 12:03:44,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:45,000 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 78 flow [2022-12-13 12:03:45,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:45,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:45,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 78 flow [2022-12-13 12:03:45,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 78 flow [2022-12-13 12:03:45,013 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:03:45,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:03:45,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:03:45,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 78 flow [2022-12-13 12:03:45,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 12:03:45,345 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:03:45,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 349 [2022-12-13 12:03:45,348 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 78 flow [2022-12-13 12:03:45,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:45,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:45,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:45,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:03:45,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1223461275, now seen corresponding path program 1 times [2022-12-13 12:03:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:45,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482446908] [2022-12-13 12:03:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:45,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482446908] [2022-12-13 12:03:45,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482446908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:45,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:45,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:03:45,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742548964] [2022-12-13 12:03:45,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:45,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:03:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:45,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:03:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:03:45,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 12:03:45,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:45,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:45,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 12:03:45,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:46,708 INFO L130 PetriNetUnfolder]: 4648/6915 cut-off events. [2022-12-13 12:03:46,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:03:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13468 conditions, 6915 events. 4648/6915 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 39866 event pairs, 1462 based on Foata normal form. 100/5506 useless extension candidates. Maximal degree in co-relation 13460. Up to 5325 conditions per place. [2022-12-13 12:03:46,747 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 42 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-12-13 12:03:46,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 210 flow [2022-12-13 12:03:46,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:03:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:03:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 12:03:46,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 12:03:46,749 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 78 flow. Second operand 3 states and 75 transitions. [2022-12-13 12:03:46,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 210 flow [2022-12-13 12:03:46,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:03:46,750 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 86 flow [2022-12-13 12:03:46,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 12:03:46,751 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-13 12:03:46,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:46,751 INFO L89 Accepts]: Start accepts. Operand has 47 places, 35 transitions, 86 flow [2022-12-13 12:03:46,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:46,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:46,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 86 flow [2022-12-13 12:03:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 86 flow [2022-12-13 12:03:46,758 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:03:46,758 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:03:46,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:03:46,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 86 flow [2022-12-13 12:03:46,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-13 12:03:46,906 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:03:46,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 12:03:46,907 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 86 flow [2022-12-13 12:03:46,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:46,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:46,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:46,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:03:46,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -727405723, now seen corresponding path program 1 times [2022-12-13 12:03:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:46,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370303724] [2022-12-13 12:03:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:47,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370303724] [2022-12-13 12:03:47,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370303724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:47,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:47,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:03:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518280472] [2022-12-13 12:03:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:47,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:03:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:03:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:03:47,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 12:03:47,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:47,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:47,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 12:03:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:47,933 INFO L130 PetriNetUnfolder]: 4455/6729 cut-off events. [2022-12-13 12:03:47,934 INFO L131 PetriNetUnfolder]: For 625/625 co-relation queries the response was YES. [2022-12-13 12:03:47,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13972 conditions, 6729 events. 4455/6729 cut-off events. For 625/625 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 40912 event pairs, 755 based on Foata normal form. 60/5330 useless extension candidates. Maximal degree in co-relation 13961. Up to 5209 conditions per place. [2022-12-13 12:03:47,965 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-12-13 12:03:47,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 197 flow [2022-12-13 12:03:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:03:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:03:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 12:03:47,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:03:47,966 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 86 flow. Second operand 3 states and 70 transitions. [2022-12-13 12:03:47,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 197 flow [2022-12-13 12:03:47,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:03:47,968 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 90 flow [2022-12-13 12:03:47,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 12:03:47,968 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2022-12-13 12:03:47,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:47,969 INFO L89 Accepts]: Start accepts. Operand has 48 places, 35 transitions, 90 flow [2022-12-13 12:03:47,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:47,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:47,969 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 90 flow [2022-12-13 12:03:47,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 90 flow [2022-12-13 12:03:47,974 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:03:47,975 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:03:47,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 35 events. 0/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 95 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:03:47,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 90 flow [2022-12-13 12:03:47,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 12:03:47,976 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:03:47,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 12:03:47,977 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 90 flow [2022-12-13 12:03:47,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:47,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:47,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:47,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:03:47,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1449126242, now seen corresponding path program 1 times [2022-12-13 12:03:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:47,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313598038] [2022-12-13 12:03:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:48,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:48,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313598038] [2022-12-13 12:03:48,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313598038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:48,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:48,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:03:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253808095] [2022-12-13 12:03:48,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:48,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:03:48,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:48,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:03:48,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:03:48,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:03:48,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:48,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:48,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:03:48,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:49,531 INFO L130 PetriNetUnfolder]: 8159/12206 cut-off events. [2022-12-13 12:03:49,532 INFO L131 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2022-12-13 12:03:49,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25468 conditions, 12206 events. 8159/12206 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 77611 event pairs, 1052 based on Foata normal form. 320/9869 useless extension candidates. Maximal degree in co-relation 25456. Up to 4944 conditions per place. [2022-12-13 12:03:49,584 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 51 selfloop transitions, 3 changer transitions 7/70 dead transitions. [2022-12-13 12:03:49,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 293 flow [2022-12-13 12:03:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:03:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:03:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-13 12:03:49,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2022-12-13 12:03:49,586 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 90 flow. Second operand 4 states and 99 transitions. [2022-12-13 12:03:49,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 293 flow [2022-12-13 12:03:49,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:03:49,588 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 100 flow [2022-12-13 12:03:49,589 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2022-12-13 12:03:49,601 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2022-12-13 12:03:49,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:49,601 INFO L89 Accepts]: Start accepts. Operand has 51 places, 35 transitions, 100 flow [2022-12-13 12:03:49,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:49,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:49,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 35 transitions, 100 flow [2022-12-13 12:03:49,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 35 transitions, 100 flow [2022-12-13 12:03:49,612 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:03:49,612 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-13 12:03:49,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 35 events. 0/35 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:03:49,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 35 transitions, 100 flow [2022-12-13 12:03:49,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-13 12:03:49,618 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:03:49,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 12:03:49,623 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 100 flow [2022-12-13 12:03:49,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:49,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:49,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:03:49,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1973249731, now seen corresponding path program 1 times [2022-12-13 12:03:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989642227] [2022-12-13 12:03:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:50,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989642227] [2022-12-13 12:03:50,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989642227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:50,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:50,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:03:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751854683] [2022-12-13 12:03:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:50,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:03:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:03:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:03:50,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:03:50,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:50,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:50,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:03:50,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:51,481 INFO L130 PetriNetUnfolder]: 4090/5980 cut-off events. [2022-12-13 12:03:51,481 INFO L131 PetriNetUnfolder]: For 2634/2634 co-relation queries the response was YES. [2022-12-13 12:03:51,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13782 conditions, 5980 events. 4090/5980 cut-off events. For 2634/2634 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 32681 event pairs, 1030 based on Foata normal form. 9/4573 useless extension candidates. Maximal degree in co-relation 13768. Up to 5167 conditions per place. [2022-12-13 12:03:51,510 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 36 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-13 12:03:51,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 215 flow [2022-12-13 12:03:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:03:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:03:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 12:03:51,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-13 12:03:51,512 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 100 flow. Second operand 3 states and 67 transitions. [2022-12-13 12:03:51,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 215 flow [2022-12-13 12:03:51,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 198 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 12:03:51,516 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 107 flow [2022-12-13 12:03:51,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 12:03:51,517 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-13 12:03:51,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:51,517 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 107 flow [2022-12-13 12:03:51,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:51,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:51,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 107 flow [2022-12-13 12:03:51,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 107 flow [2022-12-13 12:03:51,524 INFO L130 PetriNetUnfolder]: 3/49 cut-off events. [2022-12-13 12:03:51,524 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 12:03:51,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 49 events. 3/49 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 135 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2022-12-13 12:03:51,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 107 flow [2022-12-13 12:03:51,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 716 [2022-12-13 12:03:51,554 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:03:51,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 12:03:51,555 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 109 flow [2022-12-13 12:03:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:51,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:51,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:03:51,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1492066232, now seen corresponding path program 1 times [2022-12-13 12:03:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331717121] [2022-12-13 12:03:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:52,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331717121] [2022-12-13 12:03:52,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331717121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:52,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:52,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:03:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037051331] [2022-12-13 12:03:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:52,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:03:52,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:03:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:03:52,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2022-12-13 12:03:52,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:52,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:52,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2022-12-13 12:03:52,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:53,576 INFO L130 PetriNetUnfolder]: 6901/10194 cut-off events. [2022-12-13 12:03:53,576 INFO L131 PetriNetUnfolder]: For 3482/3482 co-relation queries the response was YES. [2022-12-13 12:03:53,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22947 conditions, 10194 events. 6901/10194 cut-off events. For 3482/3482 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 63354 event pairs, 1525 based on Foata normal form. 45/7813 useless extension candidates. Maximal degree in co-relation 22934. Up to 5275 conditions per place. [2022-12-13 12:03:53,634 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 72 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2022-12-13 12:03:53,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 435 flow [2022-12-13 12:03:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:03:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:03:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-12-13 12:03:53,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-13 12:03:53,636 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 109 flow. Second operand 6 states and 140 transitions. [2022-12-13 12:03:53,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 435 flow [2022-12-13 12:03:53,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:03:53,638 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 206 flow [2022-12-13 12:03:53,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 12:03:53,638 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2022-12-13 12:03:53,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:53,639 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 206 flow [2022-12-13 12:03:53,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:53,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:53,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 206 flow [2022-12-13 12:03:53,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 206 flow [2022-12-13 12:03:53,660 INFO L130 PetriNetUnfolder]: 46/183 cut-off events. [2022-12-13 12:03:53,660 INFO L131 PetriNetUnfolder]: For 138/157 co-relation queries the response was YES. [2022-12-13 12:03:53,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 183 events. 46/183 cut-off events. For 138/157 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1035 event pairs, 24 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 393. Up to 78 conditions per place. [2022-12-13 12:03:53,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 206 flow [2022-12-13 12:03:53,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 898 [2022-12-13 12:03:53,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:03:53,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 12:03:53,683 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 208 flow [2022-12-13 12:03:53,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:53,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:53,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:03:53,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:53,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:53,684 INFO L85 PathProgramCache]: Analyzing trace with hash -991383260, now seen corresponding path program 2 times [2022-12-13 12:03:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:53,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616537933] [2022-12-13 12:03:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:54,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616537933] [2022-12-13 12:03:54,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616537933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:54,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:54,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:03:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136478255] [2022-12-13 12:03:54,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:54,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:03:54,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:54,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:03:54,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:03:54,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 12:03:54,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:54,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:54,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 12:03:54,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:55,478 INFO L130 PetriNetUnfolder]: 7620/11113 cut-off events. [2022-12-13 12:03:55,478 INFO L131 PetriNetUnfolder]: For 9158/9158 co-relation queries the response was YES. [2022-12-13 12:03:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29635 conditions, 11113 events. 7620/11113 cut-off events. For 9158/9158 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 68651 event pairs, 5237 based on Foata normal form. 90/8556 useless extension candidates. Maximal degree in co-relation 29618. Up to 9108 conditions per place. [2022-12-13 12:03:55,545 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 39 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2022-12-13 12:03:55,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 357 flow [2022-12-13 12:03:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:03:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:03:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-13 12:03:55,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2022-12-13 12:03:55,546 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 208 flow. Second operand 4 states and 79 transitions. [2022-12-13 12:03:55,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 357 flow [2022-12-13 12:03:55,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 344 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:03:55,562 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 263 flow [2022-12-13 12:03:55,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-13 12:03:55,562 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2022-12-13 12:03:55,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:55,562 INFO L89 Accepts]: Start accepts. Operand has 59 places, 51 transitions, 263 flow [2022-12-13 12:03:55,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:55,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:55,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 263 flow [2022-12-13 12:03:55,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 263 flow [2022-12-13 12:03:55,589 INFO L130 PetriNetUnfolder]: 66/228 cut-off events. [2022-12-13 12:03:55,589 INFO L131 PetriNetUnfolder]: For 282/303 co-relation queries the response was YES. [2022-12-13 12:03:55,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 228 events. 66/228 cut-off events. For 282/303 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1307 event pairs, 20 based on Foata normal form. 3/176 useless extension candidates. Maximal degree in co-relation 614. Up to 102 conditions per place. [2022-12-13 12:03:55,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 263 flow [2022-12-13 12:03:55,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 978 [2022-12-13 12:03:55,593 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:03:55,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 12:03:55,594 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 263 flow [2022-12-13 12:03:55,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:55,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:55,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:55,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:03:55,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:55,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1899707364, now seen corresponding path program 3 times [2022-12-13 12:03:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:55,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409906329] [2022-12-13 12:03:55,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:56,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409906329] [2022-12-13 12:03:56,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409906329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:56,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:56,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:03:56,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807646153] [2022-12-13 12:03:56,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:56,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:03:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:03:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:03:56,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2022-12-13 12:03:56,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:56,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:56,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2022-12-13 12:03:56,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:58,002 INFO L130 PetriNetUnfolder]: 10092/14859 cut-off events. [2022-12-13 12:03:58,003 INFO L131 PetriNetUnfolder]: For 16927/16927 co-relation queries the response was YES. [2022-12-13 12:03:58,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40574 conditions, 14859 events. 10092/14859 cut-off events. For 16927/16927 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 98154 event pairs, 3025 based on Foata normal form. 342/11336 useless extension candidates. Maximal degree in co-relation 40556. Up to 6752 conditions per place. [2022-12-13 12:03:58,055 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 53 selfloop transitions, 14 changer transitions 2/78 dead transitions. [2022-12-13 12:03:58,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 488 flow [2022-12-13 12:03:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:03:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:03:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 12:03:58,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2022-12-13 12:03:58,057 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 263 flow. Second operand 5 states and 104 transitions. [2022-12-13 12:03:58,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 488 flow [2022-12-13 12:03:58,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 472 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:03:58,069 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 299 flow [2022-12-13 12:03:58,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2022-12-13 12:03:58,069 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2022-12-13 12:03:58,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:58,070 INFO L89 Accepts]: Start accepts. Operand has 63 places, 51 transitions, 299 flow [2022-12-13 12:03:58,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:58,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:58,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 51 transitions, 299 flow [2022-12-13 12:03:58,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 51 transitions, 299 flow [2022-12-13 12:03:58,096 INFO L130 PetriNetUnfolder]: 52/230 cut-off events. [2022-12-13 12:03:58,096 INFO L131 PetriNetUnfolder]: For 397/424 co-relation queries the response was YES. [2022-12-13 12:03:58,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 230 events. 52/230 cut-off events. For 397/424 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1384 event pairs, 21 based on Foata normal form. 5/171 useless extension candidates. Maximal degree in co-relation 642. Up to 95 conditions per place. [2022-12-13 12:03:58,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 51 transitions, 299 flow [2022-12-13 12:03:58,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 964 [2022-12-13 12:03:58,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] $Ultimate##0-->L812: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= (store |v_#memory_int_612| |v_~#y~0.base_306| (store (select |v_#memory_int_612| |v_~#y~0.base_306|) |v_~#y~0.offset_306| 1)) |v_#memory_int_611|) (= v_~x~0_72 v_~__unbuffered_p2_EAX~0_89) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23)) InVars {~#y~0.offset=|v_~#y~0.offset_306|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, #memory_int=|v_#memory_int_612|, ~#y~0.base=|v_~#y~0.base_306|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~#y~0.offset=|v_~#y~0.offset_306|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, #memory_int=|v_#memory_int_611|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~#y~0.base=|v_~#y~0.base_306|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0] and [783] $Ultimate##0-->L829: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= (store |v_#memory_int_343| |v_~#y~0.base_216| (store (select |v_#memory_int_343| |v_~#y~0.base_216|) |v_~#y~0.offset_216| 2)) |v_#memory_int_342|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_216|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_216|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_216|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_216|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] [2022-12-13 12:03:58,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] $Ultimate##0-->L812: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= (store |v_#memory_int_612| |v_~#y~0.base_306| (store (select |v_#memory_int_612| |v_~#y~0.base_306|) |v_~#y~0.offset_306| 1)) |v_#memory_int_611|) (= v_~x~0_72 v_~__unbuffered_p2_EAX~0_89) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23)) InVars {~#y~0.offset=|v_~#y~0.offset_306|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, #memory_int=|v_#memory_int_612|, ~#y~0.base=|v_~#y~0.base_306|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~#y~0.offset=|v_~#y~0.offset_306|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, #memory_int=|v_#memory_int_611|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~#y~0.base=|v_~#y~0.base_306|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0] and [817] L859-3-->L861-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_30| 0)) (= (store |v_#valid_112| |v_ULTIMATE.start_main_~#t2228~0#1.base_30| 1) |v_#valid_111|) (= (select |v_#valid_112| |v_ULTIMATE.start_main_~#t2228~0#1.base_30|) 0) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_30|) (= |v_#memory_int_410| (store |v_#memory_int_411| |v_ULTIMATE.start_main_~#t2228~0#1.base_30| (store (select |v_#memory_int_411| |v_ULTIMATE.start_main_~#t2228~0#1.base_30|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_30| |v_ULTIMATE.start_main_#t~pre31#1_69|))) (= |v_#pthreadsForks_76| |v_ULTIMATE.start_main_#t~pre31#1_69|) (= (store |v_#length_99| |v_ULTIMATE.start_main_~#t2228~0#1.base_30| 4) |v_#length_98|) (< |v_#StackHeapBarrier_44| |v_ULTIMATE.start_main_~#t2228~0#1.base_30|) (= |v_#pthreadsForks_75| (+ |v_#pthreadsForks_76| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_44|, #pthreadsForks=|v_#pthreadsForks_76|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_411|, #length=|v_#length_99|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_69|, #StackHeapBarrier=|v_#StackHeapBarrier_44|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_31|, #pthreadsForks=|v_#pthreadsForks_75|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_25|, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_410|, ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_30|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_30|, #length=|v_#length_98|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #valid, #memory_int, ULTIMATE.start_main_~#t2228~0#1.base, ULTIMATE.start_main_~#t2228~0#1.offset, #length] [2022-12-13 12:03:58,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [822] $Ultimate##0-->L812: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= (store |v_#memory_int_612| |v_~#y~0.base_306| (store (select |v_#memory_int_612| |v_~#y~0.base_306|) |v_~#y~0.offset_306| 1)) |v_#memory_int_611|) (= v_~x~0_72 v_~__unbuffered_p2_EAX~0_89) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23)) InVars {~#y~0.offset=|v_~#y~0.offset_306|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, #memory_int=|v_#memory_int_612|, ~#y~0.base=|v_~#y~0.base_306|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~#y~0.offset=|v_~#y~0.offset_306|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, #memory_int=|v_#memory_int_611|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~#y~0.base=|v_~#y~0.base_306|, ~x~0=v_~x~0_72, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0] and [736] L3-1-->L872: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_104 256) 0))) (let ((.cse0 (not .cse5)) (.cse3 (not (= (mod v_~y$w_buff0_used~0_258 256) 0))) (.cse9 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd0~0_99 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_259 256) 0))) (let ((.cse1 (not .cse6)) (.cse2 (not .cse8)) (.cse10 (not .cse9)) (.cse11 (and .cse0 .cse3)) (.cse7 (select |v_#memory_int_275| |v_~#y~0.base_190|))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_259) v_~y$w_buff0_used~0_258) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_233 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_103 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_99) v_~y$r_buff1_thd0~0_98) (let ((.cse4 (= |v_ULTIMATE.start_main_#t~mem33#1_39| |v_ULTIMATE.start_main_#t~mem33#1_41|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_25| v_~y$w_buff0~0_138) .cse0 .cse4 (= |v_ULTIMATE.start_main_#t~ite34#1_34| |v_ULTIMATE.start_main_#t~ite34#1_32|) .cse1) (and (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite34#1_32| |v_ULTIMATE.start_main_#t~ite35#1_25|) (or (and (= |v_ULTIMATE.start_main_#t~mem33#1_39| (select .cse7 |v_~#y~0.offset_190|)) (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~ite34#1_32| |v_ULTIMATE.start_main_#t~mem33#1_39|)) (and (= |v_ULTIMATE.start_main_#t~ite34#1_32| v_~y$w_buff1~0_138) .cse4 .cse2 .cse10))))) (= v_~y$r_buff0_thd0~0_103 (ite .cse11 0 v_~y$r_buff0_thd0~0_104)) (= (ite (or (and .cse2 .cse10) .cse11) 0 v_~y$w_buff1_used~0_234) v_~y$w_buff1_used~0_233) (= (store |v_#memory_int_275| |v_~#y~0.base_190| (store .cse7 |v_~#y~0.offset_190| |v_ULTIMATE.start_main_#t~ite35#1_25|)) |v_#memory_int_274|))))) InVars {~#y~0.offset=|v_~#y~0.offset_190|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_41|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_138, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_138, #memory_int=|v_#memory_int_275|, ~#y~0.base=|v_~#y~0.base_190|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_24|, ~#y~0.offset=|v_~#y~0.offset_190|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_138, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_103, ~y$w_buff0~0=v_~y$w_buff0~0_138, #memory_int=|v_#memory_int_274|, ~#y~0.base=|v_~#y~0.base_190|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_32|, |v_ULTIMATE.start_main_#t~ite35#1_25|, |v_ULTIMATE.start_main_#t~mem33#1_39|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~mem33#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite34#1, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:03:58,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:03:58,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 900 [2022-12-13 12:03:58,970 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 319 flow [2022-12-13 12:03:58,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:58,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:58,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:58,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:03:58,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash -668110285, now seen corresponding path program 1 times [2022-12-13 12:03:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:58,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710518844] [2022-12-13 12:03:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:59,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:59,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710518844] [2022-12-13 12:03:59,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710518844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:59,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:59,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:03:59,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341423110] [2022-12-13 12:03:59,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:59,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:03:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:03:59,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:03:59,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-13 12:03:59,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:59,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:59,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-13 12:03:59,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:01,820 INFO L130 PetriNetUnfolder]: 20279/27757 cut-off events. [2022-12-13 12:04:01,820 INFO L131 PetriNetUnfolder]: For 49058/49760 co-relation queries the response was YES. [2022-12-13 12:04:01,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80353 conditions, 27757 events. 20279/27757 cut-off events. For 49058/49760 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 175709 event pairs, 8289 based on Foata normal form. 596/17032 useless extension candidates. Maximal degree in co-relation 80333. Up to 27478 conditions per place. [2022-12-13 12:04:01,976 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 67 selfloop transitions, 13 changer transitions 1/87 dead transitions. [2022-12-13 12:04:01,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 87 transitions, 709 flow [2022-12-13 12:04:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:04:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:04:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 12:04:01,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.675 [2022-12-13 12:04:01,978 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 319 flow. Second operand 3 states and 81 transitions. [2022-12-13 12:04:01,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 87 transitions, 709 flow [2022-12-13 12:04:01,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 692 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:01,991 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 399 flow [2022-12-13 12:04:01,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-12-13 12:04:01,992 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-13 12:04:01,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:01,992 INFO L89 Accepts]: Start accepts. Operand has 64 places, 62 transitions, 399 flow [2022-12-13 12:04:01,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:01,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:01,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 62 transitions, 399 flow [2022-12-13 12:04:01,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 62 transitions, 399 flow [2022-12-13 12:04:03,031 INFO L130 PetriNetUnfolder]: 8616/13122 cut-off events. [2022-12-13 12:04:03,031 INFO L131 PetriNetUnfolder]: For 9529/9778 co-relation queries the response was YES. [2022-12-13 12:04:03,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31004 conditions, 13122 events. 8616/13122 cut-off events. For 9529/9778 co-relation queries the response was YES. Maximal size of possible extension queue 1742. Compared 102389 event pairs, 5256 based on Foata normal form. 75/5827 useless extension candidates. Maximal degree in co-relation 30985. Up to 10741 conditions per place. [2022-12-13 12:04:03,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 62 transitions, 399 flow [2022-12-13 12:04:03,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-13 12:04:03,172 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:03,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1181 [2022-12-13 12:04:03,173 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 399 flow [2022-12-13 12:04:03,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:03,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:03,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:03,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:04:03,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:04:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -951657747, now seen corresponding path program 1 times [2022-12-13 12:04:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:03,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039555177] [2022-12-13 12:04:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:04:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:03,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039555177] [2022-12-13 12:04:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039555177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:03,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:03,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024437186] [2022-12-13 12:04:03,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:03,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-13 12:04:03,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:03,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:03,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-13 12:04:03,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:05,627 INFO L130 PetriNetUnfolder]: 15686/22378 cut-off events. [2022-12-13 12:04:05,627 INFO L131 PetriNetUnfolder]: For 41180/41756 co-relation queries the response was YES. [2022-12-13 12:04:05,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80870 conditions, 22378 events. 15686/22378 cut-off events. For 41180/41756 co-relation queries the response was YES. Maximal size of possible extension queue 1710. Compared 149117 event pairs, 3141 based on Foata normal form. 765/14240 useless extension candidates. Maximal degree in co-relation 80848. Up to 20926 conditions per place. [2022-12-13 12:04:05,773 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 86 selfloop transitions, 25 changer transitions 2/119 dead transitions. [2022-12-13 12:04:05,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 119 transitions, 1032 flow [2022-12-13 12:04:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 12:04:05,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 12:04:05,775 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 399 flow. Second operand 4 states and 112 transitions. [2022-12-13 12:04:05,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 119 transitions, 1032 flow [2022-12-13 12:04:05,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 1019 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:05,794 INFO L231 Difference]: Finished difference. Result has 67 places, 74 transitions, 534 flow [2022-12-13 12:04:05,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=534, PETRI_PLACES=67, PETRI_TRANSITIONS=74} [2022-12-13 12:04:05,794 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-13 12:04:05,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:05,794 INFO L89 Accepts]: Start accepts. Operand has 67 places, 74 transitions, 534 flow [2022-12-13 12:04:05,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:05,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:05,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 74 transitions, 534 flow [2022-12-13 12:04:05,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 74 transitions, 534 flow [2022-12-13 12:04:06,792 INFO L130 PetriNetUnfolder]: 6879/11079 cut-off events. [2022-12-13 12:04:06,793 INFO L131 PetriNetUnfolder]: For 10513/16450 co-relation queries the response was YES. [2022-12-13 12:04:06,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35857 conditions, 11079 events. 6879/11079 cut-off events. For 10513/16450 co-relation queries the response was YES. Maximal size of possible extension queue 1575. Compared 90516 event pairs, 2685 based on Foata normal form. 83/5510 useless extension candidates. Maximal degree in co-relation 35836. Up to 8425 conditions per place. [2022-12-13 12:04:06,898 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 74 transitions, 534 flow [2022-12-13 12:04:06,898 INFO L226 LiptonReduction]: Number of co-enabled transitions 1410 [2022-12-13 12:04:06,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L861-3-->L3-1: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~main$tmp_guard0~0_24 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_83 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [827] $Ultimate##0-->L872: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_230 256) 0))) (let ((.cse8 (= (mod v_~y$r_buff1_thd0~0_231 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_486 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_467 256) 0)) (.cse10 (not (= (mod v_~y$w_buff0_used~0_485 256) 0))) (.cse3 (not .cse5))) (let ((.cse0 (and .cse10 .cse3)) (.cse2 (not .cse7)) (.cse4 (not .cse6)) (.cse1 (not .cse8))) (and (= v_~y$r_buff0_thd0~0_229 (ite .cse0 0 v_~y$r_buff0_thd0~0_230)) (= (ite (or (and .cse1 .cse2) .cse0) 0 v_~y$w_buff1_used~0_467) v_~y$w_buff1_used~0_466) (= v_~y$w_buff0_used~0_485 (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_486)) (= |v_P2Thread1of1ForFork0_#in~arg.base_33| v_P2Thread1of1ForFork0_~arg.base_33) (= v_~x~0_82 v_~__unbuffered_p2_EAX~0_99) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem33#1_119| |v_ULTIMATE.start_main_#t~mem33#1_117|))) (or (and (or .cse5 .cse6) (or (and (= |v_ULTIMATE.start_main_#t~mem33#1_117| 1) (or .cse7 .cse8) (= |v_ULTIMATE.start_main_#t~ite34#1_110| |v_ULTIMATE.start_main_#t~mem33#1_117|)) (and .cse9 .cse1 (= v_~y$w_buff1~0_308 |v_ULTIMATE.start_main_#t~ite34#1_110|) .cse2)) (= |v_ULTIMATE.start_main_#t~ite35#1_89| |v_ULTIMATE.start_main_#t~ite34#1_110|)) (and .cse3 .cse9 (= |v_ULTIMATE.start_main_#t~ite35#1_89| v_~y$w_buff0~0_302) (= |v_ULTIMATE.start_main_#t~ite34#1_112| |v_ULTIMATE.start_main_#t~ite34#1_110|) .cse4))) (= v_~y$r_buff1_thd0~0_230 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_466 256) 0)) .cse1) (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_229 256) 0)))) 0 v_~y$r_buff1_thd0~0_231)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_33| v_P2Thread1of1ForFork0_~arg.offset_33) (= (store |v_#memory_int_639| |v_~#y~0.base_316| (store (select |v_#memory_int_639| |v_~#y~0.base_316|) |v_~#y~0.offset_316| |v_ULTIMATE.start_main_#t~ite35#1_89|)) |v_#memory_int_637|))))) InVars {~#y~0.offset=|v_~#y~0.offset_316|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_486, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_112|, ~#y~0.base=|v_~#y~0.base_316|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_119|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_230, ~y$w_buff0~0=v_~y$w_buff0~0_302, #memory_int=|v_#memory_int_639|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_231, ~x~0=v_~x~0_82, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_467} OutVars{~#y~0.offset=|v_~#y~0.offset_316|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_485, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_33, ~#y~0.base=|v_~#y~0.base_316|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_88|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_33, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_229, ~y$w_buff0~0=v_~y$w_buff0~0_302, #memory_int=|v_#memory_int_637|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_230, ~x~0=v_~x~0_82, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_466} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_110|, |v_ULTIMATE.start_main_#t~mem33#1_117|, |v_ULTIMATE.start_main_#t~ite35#1_89|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, P2Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~mem33#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite34#1, ~y$r_buff0_thd0~0, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:07,384 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:04:07,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1591 [2022-12-13 12:04:07,385 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 74 transitions, 538 flow [2022-12-13 12:04:07,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:07,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:07,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:07,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:04:07,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:04:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:07,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1054073006, now seen corresponding path program 1 times [2022-12-13 12:04:07,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:07,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4987199] [2022-12-13 12:04:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:07,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:04:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:07,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4987199] [2022-12-13 12:04:07,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4987199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:07,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:07,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:04:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185302156] [2022-12-13 12:04:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:07,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:04:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:04:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:04:07,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 12:04:07,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 74 transitions, 538 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:07,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:07,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 12:04:07,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:11,015 INFO L130 PetriNetUnfolder]: 24214/35890 cut-off events. [2022-12-13 12:04:11,015 INFO L131 PetriNetUnfolder]: For 74330/80358 co-relation queries the response was YES. [2022-12-13 12:04:11,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144037 conditions, 35890 events. 24214/35890 cut-off events. For 74330/80358 co-relation queries the response was YES. Maximal size of possible extension queue 2292. Compared 260537 event pairs, 5873 based on Foata normal form. 2121/29411 useless extension candidates. Maximal degree in co-relation 144013. Up to 24625 conditions per place. [2022-12-13 12:04:11,235 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 115 selfloop transitions, 2 changer transitions 5/139 dead transitions. [2022-12-13 12:04:11,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 1247 flow [2022-12-13 12:04:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:04:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:04:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2022-12-13 12:04:11,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 12:04:11,236 INFO L175 Difference]: Start difference. First operand has 67 places, 74 transitions, 538 flow. Second operand 4 states and 104 transitions. [2022-12-13 12:04:11,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 1247 flow [2022-12-13 12:04:11,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 1149 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-13 12:04:11,259 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 503 flow [2022-12-13 12:04:11,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2022-12-13 12:04:11,259 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-13 12:04:11,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:11,260 INFO L89 Accepts]: Start accepts. Operand has 70 places, 75 transitions, 503 flow [2022-12-13 12:04:11,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:11,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:11,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 75 transitions, 503 flow [2022-12-13 12:04:11,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 75 transitions, 503 flow [2022-12-13 12:04:12,611 INFO L130 PetriNetUnfolder]: 11143/18015 cut-off events. [2022-12-13 12:04:12,612 INFO L131 PetriNetUnfolder]: For 14670/21166 co-relation queries the response was YES. [2022-12-13 12:04:12,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54979 conditions, 18015 events. 11143/18015 cut-off events. For 14670/21166 co-relation queries the response was YES. Maximal size of possible extension queue 2496. Compared 154714 event pairs, 3587 based on Foata normal form. 150/8341 useless extension candidates. Maximal degree in co-relation 54957. Up to 14509 conditions per place. [2022-12-13 12:04:12,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 75 transitions, 503 flow [2022-12-13 12:04:12,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 1426 [2022-12-13 12:04:12,808 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:12,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1550 [2022-12-13 12:04:12,809 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 503 flow [2022-12-13 12:04:12,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:12,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:12,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:12,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:04:12,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:04:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:12,810 INFO L85 PathProgramCache]: Analyzing trace with hash 866697867, now seen corresponding path program 1 times [2022-12-13 12:04:12,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:12,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120333180] [2022-12-13 12:04:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:12,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:04:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:12,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120333180] [2022-12-13 12:04:12,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120333180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:12,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:12,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:04:12,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600905839] [2022-12-13 12:04:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:12,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:04:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:04:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:04:12,973 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-13 12:04:12,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:12,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:12,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-13 12:04:12,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:15,175 INFO L130 PetriNetUnfolder]: 13526/21241 cut-off events. [2022-12-13 12:04:15,175 INFO L131 PetriNetUnfolder]: For 34986/35785 co-relation queries the response was YES. [2022-12-13 12:04:15,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85393 conditions, 21241 events. 13526/21241 cut-off events. For 34986/35785 co-relation queries the response was YES. Maximal size of possible extension queue 1434. Compared 161410 event pairs, 969 based on Foata normal form. 1717/14251 useless extension candidates. Maximal degree in co-relation 85368. Up to 14743 conditions per place. [2022-12-13 12:04:15,300 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 88 selfloop transitions, 37 changer transitions 7/139 dead transitions. [2022-12-13 12:04:15,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 139 transitions, 1236 flow [2022-12-13 12:04:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:04:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:04:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2022-12-13 12:04:15,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.685 [2022-12-13 12:04:15,302 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 503 flow. Second operand 5 states and 137 transitions. [2022-12-13 12:04:15,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 139 transitions, 1236 flow [2022-12-13 12:04:15,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 139 transitions, 1233 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:04:15,322 INFO L231 Difference]: Finished difference. Result has 74 places, 85 transitions, 666 flow [2022-12-13 12:04:15,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=666, PETRI_PLACES=74, PETRI_TRANSITIONS=85} [2022-12-13 12:04:15,322 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2022-12-13 12:04:15,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:15,323 INFO L89 Accepts]: Start accepts. Operand has 74 places, 85 transitions, 666 flow [2022-12-13 12:04:15,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:15,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:15,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 85 transitions, 666 flow [2022-12-13 12:04:15,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 85 transitions, 666 flow [2022-12-13 12:04:16,058 INFO L130 PetriNetUnfolder]: 5552/10319 cut-off events. [2022-12-13 12:04:16,058 INFO L131 PetriNetUnfolder]: For 9764/19737 co-relation queries the response was YES. [2022-12-13 12:04:16,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41850 conditions, 10319 events. 5552/10319 cut-off events. For 9764/19737 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 94946 event pairs, 869 based on Foata normal form. 135/5103 useless extension candidates. Maximal degree in co-relation 41826. Up to 8290 conditions per place. [2022-12-13 12:04:16,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 85 transitions, 666 flow [2022-12-13 12:04:16,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 1346 [2022-12-13 12:04:16,195 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:04:16,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 873 [2022-12-13 12:04:16,196 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 666 flow [2022-12-13 12:04:16,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:16,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:04:16,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:04:16,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:04:16,197 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:04:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:04:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 440151581, now seen corresponding path program 1 times [2022-12-13 12:04:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:04:16,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029218473] [2022-12-13 12:04:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:04:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:04:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:04:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:04:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:04:16,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029218473] [2022-12-13 12:04:16,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029218473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:04:16,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:04:16,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:04:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009254043] [2022-12-13 12:04:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:04:16,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:04:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:04:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:04:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:04:16,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2022-12-13 12:04:16,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:04:16,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:04:16,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2022-12-13 12:04:16,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:04:17,606 INFO L130 PetriNetUnfolder]: 8356/13145 cut-off events. [2022-12-13 12:04:17,607 INFO L131 PetriNetUnfolder]: For 19874/20481 co-relation queries the response was YES. [2022-12-13 12:04:17,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64910 conditions, 13145 events. 8356/13145 cut-off events. For 19874/20481 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 93855 event pairs, 77 based on Foata normal form. 1447/8585 useless extension candidates. Maximal degree in co-relation 64883. Up to 8659 conditions per place. [2022-12-13 12:04:17,679 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 52 selfloop transitions, 49 changer transitions 30/135 dead transitions. [2022-12-13 12:04:17,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 135 transitions, 1299 flow [2022-12-13 12:04:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:04:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:04:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-12-13 12:04:17,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2022-12-13 12:04:17,681 INFO L175 Difference]: Start difference. First operand has 74 places, 85 transitions, 666 flow. Second operand 6 states and 142 transitions. [2022-12-13 12:04:17,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 135 transitions, 1299 flow [2022-12-13 12:04:18,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 135 transitions, 1148 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-12-13 12:04:18,094 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 573 flow [2022-12-13 12:04:18,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2022-12-13 12:04:18,095 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2022-12-13 12:04:18,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:04:18,095 INFO L89 Accepts]: Start accepts. Operand has 75 places, 73 transitions, 573 flow [2022-12-13 12:04:18,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:04:18,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:04:18,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 73 transitions, 573 flow [2022-12-13 12:04:18,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 73 transitions, 573 flow [2022-12-13 12:04:18,188 INFO L130 PetriNetUnfolder]: 766/1480 cut-off events. [2022-12-13 12:04:18,188 INFO L131 PetriNetUnfolder]: For 1368/4608 co-relation queries the response was YES. [2022-12-13 12:04:18,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5844 conditions, 1480 events. 766/1480 cut-off events. For 1368/4608 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 9231 event pairs, 2 based on Foata normal form. 3/565 useless extension candidates. Maximal degree in co-relation 5821. Up to 973 conditions per place. [2022-12-13 12:04:18,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 73 transitions, 573 flow [2022-12-13 12:04:18,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-13 12:04:18,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->L861-2: Formula: (and (= (let ((.cse0 (store |v_#memory_int_633| |v_~#y~0.base_314| (store (select |v_#memory_int_633| |v_~#y~0.base_314|) |v_~#y~0.offset_314| 1)))) (store .cse0 |v_ULTIMATE.start_main_~#t2228~0#1.base_32| (store (select .cse0 |v_ULTIMATE.start_main_~#t2228~0#1.base_32|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_32| |v_ULTIMATE.start_main_#t~pre31#1_121|))) |v_#memory_int_631|) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_32|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_32| 0)) (= |v_#pthreadsForks_88| |v_ULTIMATE.start_main_#t~pre31#1_121|) (= (select |v_#valid_124| |v_ULTIMATE.start_main_~#t2228~0#1.base_32|) 0) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (< |v_#StackHeapBarrier_50| |v_ULTIMATE.start_main_~#t2228~0#1.base_32|) (= (store |v_#valid_124| |v_ULTIMATE.start_main_~#t2228~0#1.base_32| 1) |v_#valid_123|) (= v_~x~0_80 v_~__unbuffered_p2_EAX~0_97) (= |v_#pthreadsForks_87| (+ |v_#pthreadsForks_88| 1)) (= (store |v_#length_111| |v_ULTIMATE.start_main_~#t2228~0#1.base_32| 4) |v_#length_110|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_50|, ~#y~0.offset=|v_~#y~0.offset_314|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, #pthreadsForks=|v_#pthreadsForks_88|, #valid=|v_#valid_124|, #memory_int=|v_#memory_int_633|, #length=|v_#length_111|, ~#y~0.base=|v_~#y~0.base_314|, ~x~0=v_~x~0_80, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_35|, ~#y~0.offset=|v_~#y~0.offset_314|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_32|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_32|, ~#y~0.base=|v_~#y~0.base_314|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_121|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, #pthreadsForks=|v_#pthreadsForks_87|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_27|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_631|, #length=|v_#length_110|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~x~0=v_~x~0_80, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, P2Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, P2Thread1of1ForFork0_~arg.offset, #valid, ULTIMATE.start_main_~#t2228~0#1.base, ULTIMATE.start_main_~#t2228~0#1.offset, #memory_int, #length, ~__unbuffered_p2_EAX~0] and [696] L812-->L820: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd3~0_28 256) 0))) (let ((.cse0 (= (mod v_~y$w_buff0_used~0_215 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd3~0_28 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_214 256) 0))) (.cse9 (not .cse1)) (.cse4 (= (mod v_~y$w_buff1_used~0_190 256) 0))) (let ((.cse6 (not .cse4)) (.cse10 (and .cse11 .cse9)) (.cse2 (select |v_#memory_int_219| |v_~#y~0.base_154|)) (.cse7 (not .cse3)) (.cse8 (not .cse0))) (and (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem19_1| |v_P2_#t~mem19_36|))) (or (and (or .cse0 .cse1) (or (and (= |v_P2_#t~ite20_33| |v_P2_#t~mem19_36|) (= |v_P2_#t~mem19_36| (select .cse2 |v_~#y~0.offset_154|)) (or .cse3 .cse4)) (and .cse5 (= v_~y$w_buff1~0_100 |v_P2_#t~ite20_33|) .cse6 .cse7)) (= |v_P2_#t~ite20_33| |v_P2_#t~ite21_33|)) (and .cse5 (= |v_P2_#t~ite20_33| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse8 (= |v_P2_#t~ite21_33| v_~y$w_buff0~0_94) .cse9))) (= v_~y$w_buff1_used~0_189 (ite (or (and .cse6 .cse7) .cse10) 0 v_~y$w_buff1_used~0_190)) (= v_~y$r_buff0_thd3~0_27 (ite .cse10 0 v_~y$r_buff0_thd3~0_28)) (= (store |v_#memory_int_219| |v_~#y~0.base_154| (store .cse2 |v_~#y~0.offset_154| |v_P2_#t~ite21_33|)) |v_#memory_int_218|) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse7)) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27) (= v_~y$w_buff0_used~0_214 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_215)))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_215, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_219|, ~#y~0.base=|v_~#y~0.base_154|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~#y~0.offset=|v_~#y~0.offset_154|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_218|, ~#y~0.base=|v_~#y~0.base_154|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} AuxVars[|v_P2_#t~ite21_33|, |v_P2_#t~mem19_36|, |v_P2_#t~ite20_33|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork0_#t~ite20, ~y$w_buff1_used~0] [2022-12-13 12:04:27,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] $Ultimate##0-->L829: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_~x~0_78 v_~__unbuffered_p2_EAX~0_95) (= (store |v_#memory_int_627| |v_~#y~0.base_312| (store (select |v_#memory_int_627| |v_~#y~0.base_312|) |v_~#y~0.offset_312| 2)) |v_#memory_int_625|) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= v_P3Thread1of1ForFork2_~arg.offset_27 |v_P3Thread1of1ForFork2_#in~arg.offset_27|) (= |v_P3Thread1of1ForFork2_#in~arg.base_27| v_P3Thread1of1ForFork2_~arg.base_27)) InVars {~#y~0.offset=|v_~#y~0.offset_312|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, #memory_int=|v_#memory_int_627|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_27|, ~#y~0.base=|v_~#y~0.base_312|, ~x~0=v_~x~0_78, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_27|} OutVars{~#y~0.offset=|v_~#y~0.offset_312|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_27, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, ~#y~0.base=|v_~#y~0.base_312|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_27, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_27|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, #memory_int=|v_#memory_int_625|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, ~x~0=v_~x~0_78, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.offset, #memory_int, ~__unbuffered_p2_EAX~0, P3Thread1of1ForFork2_~arg.base] and [830] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$r_buff0_thd0~0_248 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_513 256) 0))) (let ((.cse20 (not .cse19)) (.cse21 (not .cse18))) (let ((.cse8 (ite (and .cse20 .cse21) 0 v_~y$w_buff0_used~0_513))) (let ((.cse10 (= (mod .cse8 256) 0))) (let ((.cse30 (not .cse10))) (let ((.cse31 (and .cse30 .cse21))) (let ((.cse12 (= (mod v_~y$w_buff1_used~0_492 256) 0)) (.cse13 (= (mod v_~y$r_buff1_thd0~0_249 256) 0)) (.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_248))) (let ((.cse5 (= (mod .cse1 256) 0)) (.cse15 (not .cse13)) (.cse17 (not .cse12))) (let ((.cse25 (ite (or (and .cse15 .cse17) .cse31) 0 v_~y$w_buff1_used~0_492)) (.cse6 (not .cse5))) (let ((.cse11 (and .cse30 .cse6)) (.cse29 (= (mod .cse25 256) 0))) (let ((.cse22 (ite (or .cse11 (and .cse15 (not .cse29))) 0 v_~y$r_buff1_thd0~0_249))) (let ((.cse24 (= (mod .cse22 256) 0)) (.cse7 (= 0 (mod v_~weak$$choice2~0_179 256)))) (let ((.cse4 (= 0 (mod v_~y$w_buff1_used~0_490 256))) (.cse0 (not .cse7)) (.cse9 (and .cse29 .cse5)) (.cse2 (and .cse24 .cse5)) (.cse3 (= (mod v_~y$w_buff0_used~0_511 256) 0)) (.cse14 (select |v_#memory_int_671| |v_~#y~0.base_330|))) (and (= (mod v_~main$tmp_guard1~0_72 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= v_~y$r_buff0_thd0~0_246 (ite .cse0 .cse1 (ite (or .cse2 .cse3 (and .cse4 .cse5)) .cse1 (ite (and (not .cse3) .cse6) 0 .cse1)))) (or (and (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~mem46#1_186|) .cse7 (= |v_ULTIMATE.start_main_#t~ite47#1_146| |v_ULTIMATE.start_main_#t~mem46#1_186|)) (and (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~ite47#1_146|) .cse0 (= |v_ULTIMATE.start_main_#t~mem46#1_188| |v_ULTIMATE.start_main_#t~mem46#1_186|))) (= v_~y$w_buff0_used~0_511 (ite .cse0 .cse8 (ite (or .cse9 .cse2 .cse10) .cse8 (ite .cse11 0 .cse8)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_105 1) (= 2 v_~__unbuffered_p0_EAX~0_179) (= v_~y$mem_tmp~0_133 2) (= v_~__unbuffered_p0_EBX~0_82 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_72) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51| 0) (= v_~y$w_buff0~0_319 v_~y$w_buff0~0_320) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem33#1_145| |v_ULTIMATE.start_main_#t~mem33#1_143|))) (or (and (or (and (or .cse12 .cse13) (= (select .cse14 |v_~#y~0.offset_328|) |v_ULTIMATE.start_main_#t~mem33#1_143|) (= |v_ULTIMATE.start_main_#t~ite34#1_136| |v_ULTIMATE.start_main_#t~mem33#1_143|)) (and (= v_~y$w_buff1~0_326 |v_ULTIMATE.start_main_#t~ite34#1_136|) .cse15 .cse16 .cse17)) (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~ite34#1_136|) (or .cse18 .cse19)) (and (= v_~y$mem_tmp~0_133 v_~y$w_buff0~0_320) (= |v_ULTIMATE.start_main_#t~ite34#1_138| |v_ULTIMATE.start_main_#t~ite34#1_136|) .cse16 .cse20 .cse21))) (= v_~y$w_buff1~0_325 v_~y$w_buff1~0_326) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|) (= v_~y$r_buff1_thd0~0_247 (ite .cse0 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_246 256) 0))) (or (and .cse23 .cse24) .cse3 (and .cse23 .cse4))) .cse22 0))) (= v_~y$flush_delayed~0_167 0) (= |v_ULTIMATE.start_main_#t~nondet36#1_127| v_~weak$$choice0~0_177) (= v_~weak$$choice1~0_163 |v_ULTIMATE.start_main_#t~nondet41#1_119|) (= v_~weak$$choice2~0_179 |v_ULTIMATE.start_main_#t~nondet37#1_127|) (= v_~y$w_buff1_used~0_490 (ite .cse0 .cse25 (ite (or .cse9 .cse2 .cse3) .cse25 0))) (= (store |v_#memory_int_671| |v_~#y~0.base_330| (store .cse14 |v_~#y~0.offset_328| |v_ULTIMATE.start_main_#t~ite47#1_146|)) |v_#memory_int_669|) (let ((.cse26 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_115 256))) (.cse28 (= |v_ULTIMATE.start_main_#t~mem42#1_194| |v_ULTIMATE.start_main_#t~mem42#1_192|))) (or (and (not .cse26) (let ((.cse27 (= (mod v_~weak$$choice1~0_163 256) 0))) (or (and (not .cse27) (= |v_ULTIMATE.start_main_#t~mem42#1_192| (select (select (store |v_#memory_int_671| |v_~#y~0.base_330| (store .cse14 |v_~#y~0.offset_328| v_~y$mem_tmp~0_133)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112)) (= |v_ULTIMATE.start_main_#t~mem42#1_192| |v_ULTIMATE.start_main_#t~ite43#1_189|)) (and .cse27 (= |v_ULTIMATE.start_main_#t~ite43#1_189| v_~__unbuffered_p0_EAX~0_180) .cse28))) (= |v_ULTIMATE.start_main_#t~ite43#1_189| v_~__unbuffered_p0_EAX~0_179)) (and .cse26 (= |v_ULTIMATE.start_main_#t~ite43#1_189| |v_ULTIMATE.start_main_#t~ite43#1_191|) (= v_~__unbuffered_p0_EAX~0_180 v_~__unbuffered_p0_EAX~0_179) .cse28))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_328|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_513, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_138|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_127|, ~#y~0.base=|v_~#y~0.base_330|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_119|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_180, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_145|, ~y$w_buff1~0=v_~y$w_buff1~0_326, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_191|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_188|, ~y$w_buff0~0=v_~y$w_buff0~0_320, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_248, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_194|, #memory_int=|v_#memory_int_671|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_127|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_249, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_492} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|, ~#y~0.offset=|v_~#y~0.offset_328|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ~#y~0.base=|v_~#y~0.base_330|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_107|, ~y$mem_tmp~0=v_~y$mem_tmp~0_133, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_179, ~weak$$choice1~0=v_~weak$$choice1~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$flush_delayed~0=v_~y$flush_delayed~0_167, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_90|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_187|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_143|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_77|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_145|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_81|, ~weak$$choice0~0=v_~weak$$choice0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~y$w_buff1~0=v_~y$w_buff1~0_325, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_246, #memory_int=|v_#memory_int_669|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ~weak$$choice2~0=v_~weak$$choice2~0_179, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_247, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_490} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_136|, |v_ULTIMATE.start_main_#t~ite47#1_146|, |v_ULTIMATE.start_main_#t~ite43#1_189|, |v_ULTIMATE.start_main_#t~mem33#1_143|, |v_ULTIMATE.start_main_#t~mem42#1_192|, |v_ULTIMATE.start_main_#t~mem46#1_186|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:30,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] $Ultimate##0-->L861-2: Formula: (and (= (let ((.cse0 (store |v_#memory_int_633| |v_~#y~0.base_314| (store (select |v_#memory_int_633| |v_~#y~0.base_314|) |v_~#y~0.offset_314| 1)))) (store .cse0 |v_ULTIMATE.start_main_~#t2228~0#1.base_32| (store (select .cse0 |v_ULTIMATE.start_main_~#t2228~0#1.base_32|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_32| |v_ULTIMATE.start_main_#t~pre31#1_121|))) |v_#memory_int_631|) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_32|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_31| v_P2Thread1of1ForFork0_~arg.offset_31) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_32| 0)) (= |v_#pthreadsForks_88| |v_ULTIMATE.start_main_#t~pre31#1_121|) (= (select |v_#valid_124| |v_ULTIMATE.start_main_~#t2228~0#1.base_32|) 0) (= |v_P2Thread1of1ForFork0_#in~arg.base_31| v_P2Thread1of1ForFork0_~arg.base_31) (< |v_#StackHeapBarrier_50| |v_ULTIMATE.start_main_~#t2228~0#1.base_32|) (= (store |v_#valid_124| |v_ULTIMATE.start_main_~#t2228~0#1.base_32| 1) |v_#valid_123|) (= v_~x~0_80 v_~__unbuffered_p2_EAX~0_97) (= |v_#pthreadsForks_87| (+ |v_#pthreadsForks_88| 1)) (= (store |v_#length_111| |v_ULTIMATE.start_main_~#t2228~0#1.base_32| 4) |v_#length_110|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_50|, ~#y~0.offset=|v_~#y~0.offset_314|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, #pthreadsForks=|v_#pthreadsForks_88|, #valid=|v_#valid_124|, #memory_int=|v_#memory_int_633|, #length=|v_#length_111|, ~#y~0.base=|v_~#y~0.base_314|, ~x~0=v_~x~0_80, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_35|, ~#y~0.offset=|v_~#y~0.offset_314|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_31, ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_32|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_32|, ~#y~0.base=|v_~#y~0.base_314|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_121|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_31, #pthreadsForks=|v_#pthreadsForks_87|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_27|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_631|, #length=|v_#length_110|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~x~0=v_~x~0_80, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, P2Thread1of1ForFork0_~arg.base, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, P2Thread1of1ForFork0_~arg.offset, #valid, ULTIMATE.start_main_~#t2228~0#1.base, ULTIMATE.start_main_~#t2228~0#1.offset, #memory_int, #length, ~__unbuffered_p2_EAX~0] and [830] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$r_buff0_thd0~0_248 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_513 256) 0))) (let ((.cse20 (not .cse19)) (.cse21 (not .cse18))) (let ((.cse8 (ite (and .cse20 .cse21) 0 v_~y$w_buff0_used~0_513))) (let ((.cse10 (= (mod .cse8 256) 0))) (let ((.cse30 (not .cse10))) (let ((.cse31 (and .cse30 .cse21))) (let ((.cse12 (= (mod v_~y$w_buff1_used~0_492 256) 0)) (.cse13 (= (mod v_~y$r_buff1_thd0~0_249 256) 0)) (.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_248))) (let ((.cse5 (= (mod .cse1 256) 0)) (.cse15 (not .cse13)) (.cse17 (not .cse12))) (let ((.cse25 (ite (or (and .cse15 .cse17) .cse31) 0 v_~y$w_buff1_used~0_492)) (.cse6 (not .cse5))) (let ((.cse11 (and .cse30 .cse6)) (.cse29 (= (mod .cse25 256) 0))) (let ((.cse22 (ite (or .cse11 (and .cse15 (not .cse29))) 0 v_~y$r_buff1_thd0~0_249))) (let ((.cse24 (= (mod .cse22 256) 0)) (.cse7 (= 0 (mod v_~weak$$choice2~0_179 256)))) (let ((.cse4 (= 0 (mod v_~y$w_buff1_used~0_490 256))) (.cse0 (not .cse7)) (.cse9 (and .cse29 .cse5)) (.cse2 (and .cse24 .cse5)) (.cse3 (= (mod v_~y$w_buff0_used~0_511 256) 0)) (.cse14 (select |v_#memory_int_671| |v_~#y~0.base_330|))) (and (= (mod v_~main$tmp_guard1~0_72 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= v_~y$r_buff0_thd0~0_246 (ite .cse0 .cse1 (ite (or .cse2 .cse3 (and .cse4 .cse5)) .cse1 (ite (and (not .cse3) .cse6) 0 .cse1)))) (or (and (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~mem46#1_186|) .cse7 (= |v_ULTIMATE.start_main_#t~ite47#1_146| |v_ULTIMATE.start_main_#t~mem46#1_186|)) (and (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~ite47#1_146|) .cse0 (= |v_ULTIMATE.start_main_#t~mem46#1_188| |v_ULTIMATE.start_main_#t~mem46#1_186|))) (= v_~y$w_buff0_used~0_511 (ite .cse0 .cse8 (ite (or .cse9 .cse2 .cse10) .cse8 (ite .cse11 0 .cse8)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_105 1) (= 2 v_~__unbuffered_p0_EAX~0_179) (= v_~y$mem_tmp~0_133 2) (= v_~__unbuffered_p0_EBX~0_82 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_72) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51| 0) (= v_~y$w_buff0~0_319 v_~y$w_buff0~0_320) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem33#1_145| |v_ULTIMATE.start_main_#t~mem33#1_143|))) (or (and (or (and (or .cse12 .cse13) (= (select .cse14 |v_~#y~0.offset_328|) |v_ULTIMATE.start_main_#t~mem33#1_143|) (= |v_ULTIMATE.start_main_#t~ite34#1_136| |v_ULTIMATE.start_main_#t~mem33#1_143|)) (and (= v_~y$w_buff1~0_326 |v_ULTIMATE.start_main_#t~ite34#1_136|) .cse15 .cse16 .cse17)) (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~ite34#1_136|) (or .cse18 .cse19)) (and (= v_~y$mem_tmp~0_133 v_~y$w_buff0~0_320) (= |v_ULTIMATE.start_main_#t~ite34#1_138| |v_ULTIMATE.start_main_#t~ite34#1_136|) .cse16 .cse20 .cse21))) (= v_~y$w_buff1~0_325 v_~y$w_buff1~0_326) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|) (= v_~y$r_buff1_thd0~0_247 (ite .cse0 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_246 256) 0))) (or (and .cse23 .cse24) .cse3 (and .cse23 .cse4))) .cse22 0))) (= v_~y$flush_delayed~0_167 0) (= |v_ULTIMATE.start_main_#t~nondet36#1_127| v_~weak$$choice0~0_177) (= v_~weak$$choice1~0_163 |v_ULTIMATE.start_main_#t~nondet41#1_119|) (= v_~weak$$choice2~0_179 |v_ULTIMATE.start_main_#t~nondet37#1_127|) (= v_~y$w_buff1_used~0_490 (ite .cse0 .cse25 (ite (or .cse9 .cse2 .cse3) .cse25 0))) (= (store |v_#memory_int_671| |v_~#y~0.base_330| (store .cse14 |v_~#y~0.offset_328| |v_ULTIMATE.start_main_#t~ite47#1_146|)) |v_#memory_int_669|) (let ((.cse26 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_115 256))) (.cse28 (= |v_ULTIMATE.start_main_#t~mem42#1_194| |v_ULTIMATE.start_main_#t~mem42#1_192|))) (or (and (not .cse26) (let ((.cse27 (= (mod v_~weak$$choice1~0_163 256) 0))) (or (and (not .cse27) (= |v_ULTIMATE.start_main_#t~mem42#1_192| (select (select (store |v_#memory_int_671| |v_~#y~0.base_330| (store .cse14 |v_~#y~0.offset_328| v_~y$mem_tmp~0_133)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112)) (= |v_ULTIMATE.start_main_#t~mem42#1_192| |v_ULTIMATE.start_main_#t~ite43#1_189|)) (and .cse27 (= |v_ULTIMATE.start_main_#t~ite43#1_189| v_~__unbuffered_p0_EAX~0_180) .cse28))) (= |v_ULTIMATE.start_main_#t~ite43#1_189| v_~__unbuffered_p0_EAX~0_179)) (and .cse26 (= |v_ULTIMATE.start_main_#t~ite43#1_189| |v_ULTIMATE.start_main_#t~ite43#1_191|) (= v_~__unbuffered_p0_EAX~0_180 v_~__unbuffered_p0_EAX~0_179) .cse28))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_328|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_513, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_138|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_127|, ~#y~0.base=|v_~#y~0.base_330|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_119|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_180, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_145|, ~y$w_buff1~0=v_~y$w_buff1~0_326, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_191|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_188|, ~y$w_buff0~0=v_~y$w_buff0~0_320, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_248, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_194|, #memory_int=|v_#memory_int_671|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_127|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_249, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_492} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|, ~#y~0.offset=|v_~#y~0.offset_328|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ~#y~0.base=|v_~#y~0.base_330|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_107|, ~y$mem_tmp~0=v_~y$mem_tmp~0_133, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_179, ~weak$$choice1~0=v_~weak$$choice1~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$flush_delayed~0=v_~y$flush_delayed~0_167, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_90|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_187|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_143|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_77|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_145|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_81|, ~weak$$choice0~0=v_~weak$$choice0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~y$w_buff1~0=v_~y$w_buff1~0_325, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_246, #memory_int=|v_#memory_int_669|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ~weak$$choice2~0=v_~weak$$choice2~0_179, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_247, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_490} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_136|, |v_ULTIMATE.start_main_#t~ite47#1_146|, |v_ULTIMATE.start_main_#t~ite43#1_189|, |v_ULTIMATE.start_main_#t~mem33#1_143|, |v_ULTIMATE.start_main_#t~mem42#1_192|, |v_ULTIMATE.start_main_#t~mem46#1_186|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:31,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [829] $Ultimate##0-->L820: Formula: (let ((.cse11 (= (mod v_~y$r_buff0_thd3~0_112 256) 0))) (let ((.cse3 (let ((.cse13 (store |v_#memory_int_665| |v_~#y~0.base_328| (store (select |v_#memory_int_665| |v_~#y~0.base_328|) |v_~#y~0.offset_326| 1)))) (store .cse13 |v_ULTIMATE.start_main_~#t2228~0#1.base_34| (store (select .cse13 |v_ULTIMATE.start_main_~#t2228~0#1.base_34|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_34| |v_ULTIMATE.start_main_#t~pre31#1_125|)))) (.cse10 (= (mod v_~y$w_buff1_used~0_487 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd3~0_104 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_508 256) 0)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_507 256) 0))) (.cse6 (not .cse11))) (let ((.cse0 (and .cse1 .cse6)) (.cse5 (not .cse12)) (.cse2 (not .cse9)) (.cse7 (not .cse10)) (.cse4 (select .cse3 |v_~#y~0.base_328|))) (and (= v_~y$r_buff0_thd3~0_111 (ite .cse0 0 v_~y$r_buff0_thd3~0_112)) (= (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd3~0_111 256) 0))) (and .cse2 (not (= (mod v_~y$w_buff1_used~0_486 256) 0)))) 0 v_~y$r_buff1_thd3~0_104) v_~y$r_buff1_thd3~0_103) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_34| 0)) (= |v_#pthreadsForks_91| (+ |v_#pthreadsForks_92| 1)) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_34|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2228~0#1.base_34|) (= (store .cse3 |v_~#y~0.base_328| (store .cse4 |v_~#y~0.offset_326| |v_P2_#t~ite21_65|)) |v_#memory_int_663|) (= (store |v_#length_115| |v_ULTIMATE.start_main_~#t2228~0#1.base_34| 4) |v_#length_114|) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= (ite (and .cse5 .cse6) 0 v_~y$w_buff0_used~0_508) v_~y$w_buff0_used~0_507) (= (store |v_#valid_132| |v_ULTIMATE.start_main_~#t2228~0#1.base_34| 1) |v_#valid_131|) (= |v_#pthreadsForks_92| |v_ULTIMATE.start_main_#t~pre31#1_125|) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t2228~0#1.base_34|) 0) (= v_~x~0_86 v_~__unbuffered_p2_EAX~0_103) (= v_~y$w_buff1_used~0_486 (ite (or (and .cse2 .cse7) .cse0) 0 v_~y$w_buff1_used~0_487)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37) (let ((.cse8 (= |v_P2Thread1of1ForFork0_#t~mem19_62| |v_P2_#t~mem19_68|))) (or (and .cse8 .cse5 (= |v_P2_#t~ite21_65| v_~y$w_buff0~0_317) .cse6 (= |v_P2_#t~ite20_65| |v_P2Thread1of1ForFork0_#t~ite20_62|)) (and (or (and .cse8 .cse2 .cse7 (= v_~y$w_buff1~0_323 |v_P2_#t~ite20_65|)) (and (= (select .cse4 |v_~#y~0.offset_326|) |v_P2_#t~mem19_68|) (= |v_P2_#t~ite20_65| |v_P2_#t~mem19_68|) (or .cse9 .cse10))) (= |v_P2_#t~ite20_65| |v_P2_#t~ite21_65|) (or .cse11 .cse12)))))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_62|, ~#y~0.offset=|v_~#y~0.offset_326|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_508, ~#y~0.base=|v_~#y~0.base_328|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_62|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_323, #pthreadsForks=|v_#pthreadsForks_92|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_317, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_665|, #length=|v_#length_115|, ~x~0=v_~x~0_86, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_487} OutVars{~#y~0.offset=|v_~#y~0.offset_326|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_507, ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_34|, ~#y~0.base=|v_~#y~0.base_328|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_103, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_33|, #pthreadsForks=|v_#pthreadsForks_91|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_317, #length=|v_#length_114|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_37|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_34|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_125|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ~y$w_buff1~0=v_~y$w_buff1~0_323, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_663|, ~x~0=v_~x~0_86, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_486} AuxVars[|v_P2_#t~ite20_65|, |v_P2_#t~ite21_65|, |v_P2_#t~mem19_68|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ULTIMATE.start_main_#t~pre29#1, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, ULTIMATE.start_main_~#t2228~0#1.base, ULTIMATE.start_main_~#t2228~0#1.offset, P2Thread1of1ForFork0_#t~ite20, ULTIMATE.start_main_#t~pre31#1, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, ~y$r_buff0_thd3~0, #valid, #memory_int, #length, ~__unbuffered_p2_EAX~0, ~y$w_buff1_used~0] and [830] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$r_buff0_thd0~0_248 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_513 256) 0))) (let ((.cse20 (not .cse19)) (.cse21 (not .cse18))) (let ((.cse8 (ite (and .cse20 .cse21) 0 v_~y$w_buff0_used~0_513))) (let ((.cse10 (= (mod .cse8 256) 0))) (let ((.cse30 (not .cse10))) (let ((.cse31 (and .cse30 .cse21))) (let ((.cse12 (= (mod v_~y$w_buff1_used~0_492 256) 0)) (.cse13 (= (mod v_~y$r_buff1_thd0~0_249 256) 0)) (.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_248))) (let ((.cse5 (= (mod .cse1 256) 0)) (.cse15 (not .cse13)) (.cse17 (not .cse12))) (let ((.cse25 (ite (or (and .cse15 .cse17) .cse31) 0 v_~y$w_buff1_used~0_492)) (.cse6 (not .cse5))) (let ((.cse11 (and .cse30 .cse6)) (.cse29 (= (mod .cse25 256) 0))) (let ((.cse22 (ite (or .cse11 (and .cse15 (not .cse29))) 0 v_~y$r_buff1_thd0~0_249))) (let ((.cse24 (= (mod .cse22 256) 0)) (.cse7 (= 0 (mod v_~weak$$choice2~0_179 256)))) (let ((.cse4 (= 0 (mod v_~y$w_buff1_used~0_490 256))) (.cse0 (not .cse7)) (.cse9 (and .cse29 .cse5)) (.cse2 (and .cse24 .cse5)) (.cse3 (= (mod v_~y$w_buff0_used~0_511 256) 0)) (.cse14 (select |v_#memory_int_671| |v_~#y~0.base_330|))) (and (= (mod v_~main$tmp_guard1~0_72 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= v_~y$r_buff0_thd0~0_246 (ite .cse0 .cse1 (ite (or .cse2 .cse3 (and .cse4 .cse5)) .cse1 (ite (and (not .cse3) .cse6) 0 .cse1)))) (or (and (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~mem46#1_186|) .cse7 (= |v_ULTIMATE.start_main_#t~ite47#1_146| |v_ULTIMATE.start_main_#t~mem46#1_186|)) (and (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~ite47#1_146|) .cse0 (= |v_ULTIMATE.start_main_#t~mem46#1_188| |v_ULTIMATE.start_main_#t~mem46#1_186|))) (= v_~y$w_buff0_used~0_511 (ite .cse0 .cse8 (ite (or .cse9 .cse2 .cse10) .cse8 (ite .cse11 0 .cse8)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_105 1) (= 2 v_~__unbuffered_p0_EAX~0_179) (= v_~y$mem_tmp~0_133 2) (= v_~__unbuffered_p0_EBX~0_82 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_72) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51| 0) (= v_~y$w_buff0~0_319 v_~y$w_buff0~0_320) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem33#1_145| |v_ULTIMATE.start_main_#t~mem33#1_143|))) (or (and (or (and (or .cse12 .cse13) (= (select .cse14 |v_~#y~0.offset_328|) |v_ULTIMATE.start_main_#t~mem33#1_143|) (= |v_ULTIMATE.start_main_#t~ite34#1_136| |v_ULTIMATE.start_main_#t~mem33#1_143|)) (and (= v_~y$w_buff1~0_326 |v_ULTIMATE.start_main_#t~ite34#1_136|) .cse15 .cse16 .cse17)) (= v_~y$mem_tmp~0_133 |v_ULTIMATE.start_main_#t~ite34#1_136|) (or .cse18 .cse19)) (and (= v_~y$mem_tmp~0_133 v_~y$w_buff0~0_320) (= |v_ULTIMATE.start_main_#t~ite34#1_138| |v_ULTIMATE.start_main_#t~ite34#1_136|) .cse16 .cse20 .cse21))) (= v_~y$w_buff1~0_325 v_~y$w_buff1~0_326) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|) (= v_~y$r_buff1_thd0~0_247 (ite .cse0 .cse22 (ite (let ((.cse23 (= (mod v_~y$r_buff0_thd0~0_246 256) 0))) (or (and .cse23 .cse24) .cse3 (and .cse23 .cse4))) .cse22 0))) (= v_~y$flush_delayed~0_167 0) (= |v_ULTIMATE.start_main_#t~nondet36#1_127| v_~weak$$choice0~0_177) (= v_~weak$$choice1~0_163 |v_ULTIMATE.start_main_#t~nondet41#1_119|) (= v_~weak$$choice2~0_179 |v_ULTIMATE.start_main_#t~nondet37#1_127|) (= v_~y$w_buff1_used~0_490 (ite .cse0 .cse25 (ite (or .cse9 .cse2 .cse3) .cse25 0))) (= (store |v_#memory_int_671| |v_~#y~0.base_330| (store .cse14 |v_~#y~0.offset_328| |v_ULTIMATE.start_main_#t~ite47#1_146|)) |v_#memory_int_669|) (let ((.cse26 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_115 256))) (.cse28 (= |v_ULTIMATE.start_main_#t~mem42#1_194| |v_ULTIMATE.start_main_#t~mem42#1_192|))) (or (and (not .cse26) (let ((.cse27 (= (mod v_~weak$$choice1~0_163 256) 0))) (or (and (not .cse27) (= |v_ULTIMATE.start_main_#t~mem42#1_192| (select (select (store |v_#memory_int_671| |v_~#y~0.base_330| (store .cse14 |v_~#y~0.offset_328| v_~y$mem_tmp~0_133)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112)) (= |v_ULTIMATE.start_main_#t~mem42#1_192| |v_ULTIMATE.start_main_#t~ite43#1_189|)) (and .cse27 (= |v_ULTIMATE.start_main_#t~ite43#1_189| v_~__unbuffered_p0_EAX~0_180) .cse28))) (= |v_ULTIMATE.start_main_#t~ite43#1_189| v_~__unbuffered_p0_EAX~0_179)) (and .cse26 (= |v_ULTIMATE.start_main_#t~ite43#1_189| |v_ULTIMATE.start_main_#t~ite43#1_191|) (= v_~__unbuffered_p0_EAX~0_180 v_~__unbuffered_p0_EAX~0_179) .cse28))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_328|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_513, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_138|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_127|, ~#y~0.base=|v_~#y~0.base_330|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_119|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_180, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_145|, ~y$w_buff1~0=v_~y$w_buff1~0_326, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_191|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_188|, ~y$w_buff0~0=v_~y$w_buff0~0_320, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_248, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_194|, #memory_int=|v_#memory_int_671|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_127|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_249, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_492} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|, ~#y~0.offset=|v_~#y~0.offset_328|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_511, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ~#y~0.base=|v_~#y~0.base_330|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_107|, ~y$mem_tmp~0=v_~y$mem_tmp~0_133, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_179, ~weak$$choice1~0=v_~weak$$choice1~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_319, ~y$flush_delayed~0=v_~y$flush_delayed~0_167, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_90|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_115, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_187|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_143|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_77|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_145|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_112, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_81|, ~weak$$choice0~0=v_~weak$$choice0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ~y$w_buff1~0=v_~y$w_buff1~0_325, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_246, #memory_int=|v_#memory_int_669|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_112, ~weak$$choice2~0=v_~weak$$choice2~0_179, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_247, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_490} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_136|, |v_ULTIMATE.start_main_#t~ite47#1_146|, |v_ULTIMATE.start_main_#t~ite43#1_189|, |v_ULTIMATE.start_main_#t~mem33#1_143|, |v_ULTIMATE.start_main_#t~mem42#1_192|, |v_ULTIMATE.start_main_#t~mem46#1_186|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:36,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L861-3-->L3-1: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~main$tmp_guard0~0_24 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_83 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [843] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse19 (= (mod v_~y$r_buff0_thd0~0_259 256) 0)) (.cse20 (= (mod v_~y$w_buff0_used~0_563 256) 0))) (let ((.cse21 (not .cse20)) (.cse22 (not .cse19))) (let ((.cse26 (ite (and .cse21 .cse22) 0 v_~y$w_buff0_used~0_563))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse30 .cse22))) (let ((.cse5 (ite .cse31 0 v_~y$r_buff0_thd0~0_259)) (.cse17 (= (mod v_~y$w_buff1_used~0_539 256) 0)) (.cse18 (= (mod v_~y$r_buff1_thd0~0_254 256) 0))) (let ((.cse15 (not .cse18)) (.cse16 (not .cse17)) (.cse7 (= 0 (mod .cse5 256)))) (let ((.cse10 (not .cse7)) (.cse23 (ite (or .cse31 (and .cse15 .cse16)) 0 v_~y$w_buff1_used~0_539))) (let ((.cse29 (= (mod .cse23 256) 0)) (.cse28 (and .cse30 .cse10))) (let ((.cse11 (ite (or (and .cse15 (not .cse29)) .cse28) 0 v_~y$r_buff1_thd0~0_254))) (let ((.cse13 (= 0 (mod .cse11 256))) (.cse25 (= (mod v_~weak$$choice2~0_198 256) 0))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_538 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_562 256) 0)) (.cse2 (select |v_#memory_int_732| |v_~#y~0.base_356|)) (.cse4 (not .cse25)) (.cse24 (and .cse29 .cse7)) (.cse9 (and .cse13 .cse7))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~mem42#1_201| |v_ULTIMATE.start_main_#t~mem42#1_199|)) (.cse3 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_134 256) 0))) (or (and (let ((.cse0 (= 0 (mod v_~weak$$choice1~0_182 256)))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite43#1_196| v_~__unbuffered_p0_EAX~0_201) .cse1) (and (= |v_ULTIMATE.start_main_#t~mem42#1_199| |v_ULTIMATE.start_main_#t~ite43#1_196|) (not .cse0) (= |v_ULTIMATE.start_main_#t~mem42#1_199| (select (select (store |v_#memory_int_732| |v_~#y~0.base_356| (store .cse2 |v_~#y~0.offset_354| v_~y$mem_tmp~0_152)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_131) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_131))))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite43#1_196| v_~__unbuffered_p0_EAX~0_200)) (and (= v_~__unbuffered_p0_EAX~0_201 v_~__unbuffered_p0_EAX~0_200) (= |v_ULTIMATE.start_main_#t~ite43#1_198| |v_ULTIMATE.start_main_#t~ite43#1_196|) .cse1 .cse3))) (= v_~weak$$choice2~0_198 |v_ULTIMATE.start_main_#t~nondet37#1_131|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53| 0) (= v_~y$r_buff0_thd0~0_258 (ite .cse4 .cse5 (ite (or (and .cse6 .cse7) .cse8 .cse9) .cse5 (ite (and (not .cse8) .cse10) 0 .cse5)))) (= v_~y$r_buff1_thd0~0_253 (ite .cse4 .cse11 (ite (let ((.cse12 (= (mod v_~y$r_buff0_thd0~0_258 256) 0))) (or .cse8 (and .cse12 .cse6) (and .cse12 .cse13))) .cse11 0))) (= v_~weak$$choice1~0_182 |v_ULTIMATE.start_main_#t~nondet41#1_123|) (= |v_P3Thread1of1ForFork2_#in~arg.base_33| v_P3Thread1of1ForFork2_~arg.base_33) (= v_~__unbuffered_p2_EAX~0_107 v_~x~0_108) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem33#1_152| |v_ULTIMATE.start_main_#t~mem33#1_150|))) (or (and (or (and (= v_~y$w_buff1~0_371 |v_ULTIMATE.start_main_#t~ite34#1_143|) .cse14 .cse15 .cse16) (and (= 2 |v_ULTIMATE.start_main_#t~mem33#1_150|) (or .cse17 .cse18))) (= v_~y$mem_tmp~0_152 |v_ULTIMATE.start_main_#t~ite34#1_143|) (or .cse19 .cse20)) (and .cse21 (= |v_ULTIMATE.start_main_#t~ite34#1_145| |v_ULTIMATE.start_main_#t~ite34#1_143|) (= v_~y$mem_tmp~0_152 v_~y$w_buff0~0_362) .cse14 .cse22))) (= (ite .cse4 .cse23 (ite (or .cse8 .cse24 .cse9) .cse23 0)) v_~y$w_buff1_used~0_538) (= v_~y$w_buff0~0_362 v_~y$w_buff0~0_361) (= v_P3Thread1of1ForFork2_~arg.offset_33 |v_P3Thread1of1ForFork2_#in~arg.offset_33|) (or (and (= |v_ULTIMATE.start_main_#t~mem46#1_195| |v_ULTIMATE.start_main_#t~mem46#1_193|) (= v_~y$mem_tmp~0_152 |v_ULTIMATE.start_main_#t~ite47#1_151|) .cse4) (and (= |v_ULTIMATE.start_main_#t~ite47#1_151| |v_ULTIMATE.start_main_#t~mem46#1_193|) .cse25 (= v_~y$mem_tmp~0_152 |v_ULTIMATE.start_main_#t~mem46#1_193|))) (= (store |v_#memory_int_732| |v_~#y~0.base_356| (store .cse2 |v_~#y~0.offset_354| |v_ULTIMATE.start_main_#t~ite47#1_151|)) |v_#memory_int_730|) (= v_~y$flush_delayed~0_186 0) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_98 0) (= v_~y$mem_tmp~0_152 2) (= v_~__unbuffered_p2_EAX~0_107 1) (= 2 v_~__unbuffered_p0_EAX~0_200))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_74) (= |v_ULTIMATE.start_main_#t~nondet36#1_131| v_~weak$$choice0~0_196) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| (mod v_~main$tmp_guard1~0_74 256)) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= v_~y$w_buff0_used~0_562 (ite .cse4 .cse26 (ite (or .cse27 .cse24 .cse9) .cse26 (ite .cse28 0 .cse26)))) (= v_~y$w_buff1~0_371 v_~y$w_buff1~0_370))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_354|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_563, ~#y~0.base=|v_~#y~0.base_356|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_201, ~y$w_buff0~0=v_~y$w_buff0~0_362, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_33|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_134, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_98, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_145|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_131|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_131, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_33|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_123|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_152|, ~y$w_buff1~0=v_~y$w_buff1~0_371, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_198|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_195|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_259, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_201|, #memory_int=|v_#memory_int_732|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_131, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_131|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_108, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_539} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|, ~#y~0.offset=|v_~#y~0.offset_354|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_562, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~#y~0.base=|v_~#y~0.base_356|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_33, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_111|, ~y$mem_tmp~0=v_~y$mem_tmp~0_152, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_200, ~weak$$choice1~0=v_~weak$$choice1~0_182, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, ~y$w_buff0~0=v_~y$w_buff0~0_361, ~y$flush_delayed~0=v_~y$flush_delayed~0_186, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_92|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_33|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_107, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_134, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_192|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_147|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_98, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_79|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_150|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_131, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_33|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_83|, ~weak$$choice0~0=v_~weak$$choice0~0_196, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff1~0=v_~y$w_buff1~0_370, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_258, #memory_int=|v_#memory_int_730|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_131, ~weak$$choice2~0=v_~weak$$choice2~0_198, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_253, ~x~0=v_~x~0_108, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_538} AuxVars[|v_ULTIMATE.start_main_#t~ite47#1_151|, |v_ULTIMATE.start_main_#t~mem42#1_199|, |v_ULTIMATE.start_main_#t~ite43#1_196|, |v_ULTIMATE.start_main_#t~ite34#1_143|, |v_ULTIMATE.start_main_#t~mem46#1_193|, |v_ULTIMATE.start_main_#t~mem33#1_150|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:38,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L861-3-->L3-1: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~main$tmp_guard0~0_24 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_83 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [844] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse22 (= (mod v_~y$w_buff0_used~0_567 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd0~0_263 256) 0))) (let ((.cse15 (not .cse23)) (.cse17 (not .cse22))) (let ((.cse24 (ite (and .cse15 .cse17) 0 v_~y$w_buff0_used~0_567))) (let ((.cse25 (= (mod .cse24 256) 0))) (let ((.cse32 (not .cse25))) (let ((.cse33 (and .cse15 .cse32))) (let ((.cse9 (ite .cse33 0 v_~y$r_buff0_thd0~0_263)) (.cse19 (= (mod v_~y$w_buff1_used~0_543 256) 0)) (.cse18 (= (mod v_~y$r_buff1_thd0~0_258 256) 0))) (let ((.cse20 (not .cse18)) (.cse21 (not .cse19)) (.cse11 (= (mod .cse9 256) 0))) (let ((.cse12 (not .cse11)) (.cse13 (ite (or (and .cse20 .cse21) .cse33) 0 v_~y$w_buff1_used~0_543))) (let ((.cse30 (= (mod .cse13 256) 0)) (.cse26 (and .cse12 .cse32))) (let ((.cse4 (ite (or (and .cse20 (not .cse30)) .cse26) 0 v_~y$r_buff1_thd0~0_258))) (let ((.cse0 (let ((.cse31 (store |v_#memory_int_738| |v_~#y~0.base_358| (store (select |v_#memory_int_738| |v_~#y~0.base_358|) |v_~#y~0.offset_356| 1)))) (store .cse31 |v_ULTIMATE.start_main_~#t2228~0#1.base_39| (store (select .cse31 |v_ULTIMATE.start_main_~#t2228~0#1.base_39|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre31#1_130|)))) (.cse8 (= (mod .cse4 256) 0)) (.cse3 (= (mod v_~weak$$choice2~0_200 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_542 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_566 256) 0)) (.cse2 (not .cse3)) (.cse14 (and .cse30 .cse11)) (.cse10 (and .cse11 .cse8)) (.cse1 (select .cse0 |v_~#y~0.base_358|))) (and (= v_~main$tmp_guard1~0_76 (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_204) (= v_~y$mem_tmp~0_154 2) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EBX~0_100 0))) 1 0) 0) 0 1)) (= (store .cse0 |v_~#y~0.base_358| (store .cse1 |v_~#y~0.offset_356| |v_ULTIMATE.start_main_#t~ite47#1_155|)) |v_#memory_int_736|) (= |v_ULTIMATE.start_main_#t~nondet36#1_135| v_~weak$$choice0~0_198) (= v_~y$w_buff1~0_375 v_~y$w_buff1~0_374) (< |v_#StackHeapBarrier_63| |v_ULTIMATE.start_main_~#t2228~0#1.base_39|) (= |v_P2Thread1of1ForFork0_#in~arg.base_41| v_P2Thread1of1ForFork0_~arg.base_41) (= (mod v_~main$tmp_guard1~0_76 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|) (= |v_#pthreadsForks_114| |v_ULTIMATE.start_main_#t~pre31#1_130|) (= (store |v_#valid_157| |v_ULTIMATE.start_main_~#t2228~0#1.base_39| 1) |v_#valid_156|) (or (and (= v_~y$mem_tmp~0_154 |v_ULTIMATE.start_main_#t~ite47#1_155|) (= |v_ULTIMATE.start_main_#t~mem46#1_201| |v_ULTIMATE.start_main_#t~mem46#1_199|) .cse2) (and .cse3 (= |v_ULTIMATE.start_main_#t~ite47#1_155| |v_ULTIMATE.start_main_#t~mem46#1_199|) (= v_~y$mem_tmp~0_154 |v_ULTIMATE.start_main_#t~mem46#1_199|))) (= v_~y$r_buff1_thd0~0_257 (ite .cse2 .cse4 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd0~0_262 256) 0))) (or .cse5 (and .cse6 .cse7) (and .cse6 .cse8))) .cse4 0))) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_39| 0)) (= v_~y$r_buff0_thd0~0_262 (ite .cse2 .cse9 (ite (or .cse10 (and .cse11 .cse7) .cse5) .cse9 (ite (and (not .cse5) .cse12) 0 .cse9)))) (= (select |v_#valid_157| |v_ULTIMATE.start_main_~#t2228~0#1.base_39|) 0) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_39|) (= v_~__unbuffered_p2_EAX~0_109 v_~x~0_110) (= v_~y$w_buff1_used~0_542 (ite .cse2 .cse13 (ite (or .cse14 .cse10 .cse5) .cse13 0))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~mem33#1_156| |v_ULTIMATE.start_main_#t~mem33#1_158|))) (or (and (= v_~y$mem_tmp~0_154 v_~y$w_buff0~0_366) .cse15 .cse16 .cse17 (= |v_ULTIMATE.start_main_#t~ite34#1_149| |v_ULTIMATE.start_main_#t~ite34#1_151|)) (and (or (and (= |v_ULTIMATE.start_main_#t~mem33#1_156| (select .cse1 |v_~#y~0.offset_356|)) (= |v_ULTIMATE.start_main_#t~ite34#1_149| |v_ULTIMATE.start_main_#t~mem33#1_156|) (or .cse18 .cse19)) (and .cse20 .cse16 .cse21 (= v_~y$w_buff1~0_375 |v_ULTIMATE.start_main_#t~ite34#1_149|))) (or .cse22 .cse23) (= v_~y$mem_tmp~0_154 |v_ULTIMATE.start_main_#t~ite34#1_149|)))) (= v_~y$w_buff0_used~0_566 (ite .cse2 .cse24 (ite (or .cse25 .cse14 .cse10) .cse24 (ite .cse26 0 .cse24)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_41| v_P2Thread1of1ForFork0_~arg.offset_41) (= v_~y$w_buff0~0_366 v_~y$w_buff0~0_365) (= (store |v_#length_137| |v_ULTIMATE.start_main_~#t2228~0#1.base_39| 4) |v_#length_136|) (= v_~weak$$choice1~0_184 |v_ULTIMATE.start_main_#t~nondet41#1_127|) (= (+ |v_#pthreadsForks_114| 1) |v_#pthreadsForks_113|) (let ((.cse27 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_136 256) 0)) (.cse28 (= |v_ULTIMATE.start_main_#t~mem42#1_207| |v_ULTIMATE.start_main_#t~mem42#1_205|))) (or (and (= v_~__unbuffered_p0_EAX~0_205 v_~__unbuffered_p0_EAX~0_204) .cse27 (= |v_ULTIMATE.start_main_#t~ite43#1_204| |v_ULTIMATE.start_main_#t~ite43#1_202|) .cse28) (and (= |v_ULTIMATE.start_main_#t~ite43#1_202| v_~__unbuffered_p0_EAX~0_204) (not .cse27) (let ((.cse29 (= (mod v_~weak$$choice1~0_184 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_202| v_~__unbuffered_p0_EAX~0_205) .cse28 .cse29) (and (not .cse29) (= |v_ULTIMATE.start_main_#t~mem42#1_205| (select (select (store .cse0 |v_~#y~0.base_358| (store .cse1 |v_~#y~0.offset_356| v_~y$mem_tmp~0_154)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_133) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_133)) (= |v_ULTIMATE.start_main_#t~mem42#1_205| |v_ULTIMATE.start_main_#t~ite43#1_202|))))))) (= v_~weak$$choice2~0_200 |v_ULTIMATE.start_main_#t~nondet37#1_135|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_55| 0) (= v_~y$flush_delayed~0_188 0))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_356|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_567, ~#y~0.base=|v_~#y~0.base_358|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_205, #pthreadsForks=|v_#pthreadsForks_114|, ~y$w_buff0~0=v_~y$w_buff0~0_366, #length=|v_#length_137|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_136, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_100, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_41|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_151|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_135|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_133, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_127|, #StackHeapBarrier=|v_#StackHeapBarrier_63|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_158|, ~y$w_buff1~0=v_~y$w_buff1~0_375, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_204|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_201|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_263, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_207|, #valid=|v_#valid_157|, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_133, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_135|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_258, ~x~0=v_~x~0_110, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_41|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_543} OutVars{ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_39|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_113|, ~y$mem_tmp~0=v_~y$mem_tmp~0_154, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_204, ~weak$$choice1~0=v_~weak$$choice1~0_184, #pthreadsForks=|v_#pthreadsForks_113|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_34|, ~y$flush_delayed~0=v_~y$flush_delayed~0_188, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_94|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, #length=|v_#length_136|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_100, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_41|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_39|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_85|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_130|, ~weak$$choice0~0=v_~weak$$choice0~0_198, #StackHeapBarrier=|v_#StackHeapBarrier_63|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~y$w_buff1~0=v_~y$w_buff1~0_374, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_257, ~x~0=v_~x~0_110, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_41|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_55|, ~#y~0.offset=|v_~#y~0.offset_356|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_566, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_76, ~#y~0.base=|v_~#y~0.base_358|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_41, ~y$w_buff0~0=v_~y$w_buff0~0_365, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_136, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_194|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_149|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_45|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_81|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_154|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_41, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_133, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_262, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_736|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_133, ~weak$$choice2~0=v_~weak$$choice2~0_200, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_542} AuxVars[|v_ULTIMATE.start_main_#t~ite47#1_155|, |v_ULTIMATE.start_main_#t~mem42#1_205|, |v_ULTIMATE.start_main_#t~mem33#1_156|, |v_ULTIMATE.start_main_#t~ite43#1_202|, |v_ULTIMATE.start_main_#t~mem46#1_199|, |v_ULTIMATE.start_main_#t~ite34#1_149|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2228~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, #length, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ULTIMATE.start_main_~#t2228~0#1.offset, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #valid, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:40,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [785] L861-3-->L3-1: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~main$tmp_guard0~0_24 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_83 4) 1 0)) 0 1)) (= (mod v_~main$tmp_guard0~0_24 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [845] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~y$w_buff0_used~0_572 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd3~0_116 256) 0))) (let ((.cse2 (not .cse5)) (.cse3 (not .cse6))) (let ((.cse45 (ite (and .cse2 .cse3) 0 v_~y$w_buff0_used~0_572))) (let ((.cse38 (= (mod v_~y$r_buff0_thd0~0_267 256) 0)) (.cse39 (= (mod .cse45 256) 0))) (let ((.cse32 (not .cse39)) (.cse33 (not .cse38))) (let ((.cse20 (ite (and .cse32 .cse33) 0 .cse45))) (let ((.cse21 (= (mod .cse20 256) 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd3~0_108 256) 0))) (let ((.cse27 (and .cse2 .cse32)) (.cse7 (not .cse9)) (.cse8 (not .cse10)) (.cse42 (not .cse21))) (let ((.cse43 (and .cse42 .cse33)) (.cse44 (ite (or .cse27 (and .cse7 .cse8)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse35 (= (mod .cse44 256) 0)) (.cse34 (= (mod v_~y$r_buff1_thd0~0_262 256) 0)) (.cse28 (ite .cse43 0 v_~y$r_buff0_thd0~0_267))) (let ((.cse29 (= (mod .cse28 256) 0)) (.cse36 (not .cse34)) (.cse37 (not .cse35))) (let ((.cse17 (ite (or (and .cse36 .cse37) .cse43) 0 .cse44)) (.cse30 (not .cse29))) (let ((.cse22 (and .cse30 .cse42)) (.cse40 (= (mod .cse17 256) 0))) (let ((.cse12 (ite (or .cse22 (and (not .cse40) .cse36)) 0 v_~y$r_buff1_thd0~0_262))) (let ((.cse14 (= (mod .cse12 256) 0)) (.cse0 (= (mod v_~weak$$choice2~0_202 256) 0)) (.cse26 (let ((.cse41 (store |v_#memory_int_744| |v_~#y~0.base_360| (store (select |v_#memory_int_744| |v_~#y~0.base_360|) |v_~#y~0.offset_358| 1)))) (store .cse41 |v_ULTIMATE.start_main_~#t2228~0#1.base_41| (store (select .cse41 |v_ULTIMATE.start_main_~#t2228~0#1.base_41|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre31#1_132|))))) (let ((.cse19 (and .cse40 .cse29)) (.cse11 (select .cse26 |v_~#y~0.base_360|)) (.cse1 (not .cse0)) (.cse18 (and .cse14 .cse29)) (.cse16 (= (mod v_~y$w_buff1_used~0_546 256) 0)) (.cse13 (= (mod v_~y$w_buff0_used~0_570 256) 0))) (and (= v_~main$tmp_guard1~0_78 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_111 1) (= v_~y$mem_tmp~0_156 2) (= v_~__unbuffered_p0_EBX~0_102 0) (= 2 v_~__unbuffered_p0_EAX~0_208))) 1 0) 0) 0 1)) (= |v_#valid_160| (store |v_#valid_161| |v_ULTIMATE.start_main_~#t2228~0#1.base_41| 1)) (= (select |v_#valid_161| |v_ULTIMATE.start_main_~#t2228~0#1.base_41|) 0) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_41| 0)) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite47#1_159| |v_ULTIMATE.start_main_#t~mem46#1_205|) (= v_~y$mem_tmp~0_156 |v_ULTIMATE.start_main_#t~mem46#1_205|)) (and (= v_~y$mem_tmp~0_156 |v_ULTIMATE.start_main_#t~ite47#1_159|) .cse1 (= |v_ULTIMATE.start_main_#t~mem46#1_207| |v_ULTIMATE.start_main_#t~mem46#1_205|))) (= v_~__unbuffered_p2_EAX~0_111 v_~x~0_112) (= |v_P2Thread1of1ForFork0_#in~arg.offset_43| v_P2Thread1of1ForFork0_~arg.offset_43) (= (+ |v_#pthreadsForks_118| 1) |v_#pthreadsForks_117|) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_41|) (let ((.cse4 (= |v_P2Thread1of1ForFork0_#t~mem19_66| |v_P2_#t~mem19_70|))) (or (and .cse2 .cse3 (= |v_P2_#t~ite20_67| |v_P2Thread1of1ForFork0_#t~ite20_66|) .cse4 (= |v_P2_#t~ite21_67| v_~y$w_buff0~0_370)) (and (= |v_P2_#t~ite20_67| |v_P2_#t~ite21_67|) (or .cse5 .cse6) (or (and .cse7 .cse4 (= v_~y$w_buff1~0_379 |v_P2_#t~ite20_67|) .cse8) (and (= |v_P2_#t~ite20_67| |v_P2_#t~mem19_70|) (or .cse9 .cse10) (= |v_P2_#t~mem19_70| (select .cse11 |v_~#y~0.offset_358|))))))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_57| 0) (= v_~y$w_buff0~0_369 v_~y$w_buff0~0_370) (= v_~y$w_buff1~0_379 v_~y$w_buff1~0_378) (= v_~weak$$choice1~0_186 |v_ULTIMATE.start_main_#t~nondet41#1_131|) (= v_~y$r_buff1_thd0~0_261 (ite .cse1 .cse12 (ite (let ((.cse15 (= (mod v_~y$r_buff0_thd0~0_266 256) 0))) (or .cse13 (and .cse14 .cse15) (and .cse16 .cse15))) .cse12 0))) (< |v_#StackHeapBarrier_65| |v_ULTIMATE.start_main_~#t2228~0#1.base_41|) (= |v_P2Thread1of1ForFork0_#in~arg.base_43| v_P2Thread1of1ForFork0_~arg.base_43) (= |v_ULTIMATE.start_main_#t~nondet36#1_139| v_~weak$$choice0~0_200) (= |v_#pthreadsForks_118| |v_ULTIMATE.start_main_#t~pre31#1_132|) (= (ite .cse1 .cse17 (ite (or .cse13 .cse18 .cse19) .cse17 0)) v_~y$w_buff1_used~0_546) (= v_~y$flush_delayed~0_190 0) (= v_~y$w_buff0_used~0_570 (ite .cse1 .cse20 (ite (or .cse21 .cse18 .cse19) .cse20 (ite .cse22 0 .cse20)))) (let ((.cse24 (= |v_ULTIMATE.start_main_#t~mem42#1_213| |v_ULTIMATE.start_main_#t~mem42#1_211|)) (.cse23 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_138 256) 0))) (or (and (= v_~__unbuffered_p0_EAX~0_209 v_~__unbuffered_p0_EAX~0_208) (= |v_ULTIMATE.start_main_#t~ite43#1_210| |v_ULTIMATE.start_main_#t~ite43#1_208|) .cse23 .cse24) (and (= |v_ULTIMATE.start_main_#t~ite43#1_208| v_~__unbuffered_p0_EAX~0_208) (let ((.cse25 (= (mod v_~weak$$choice1~0_186 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_208| v_~__unbuffered_p0_EAX~0_209) .cse25 .cse24) (and (= |v_ULTIMATE.start_main_#t~mem42#1_211| (select (select (store .cse26 |v_~#y~0.base_360| (store .cse11 |v_~#y~0.offset_358| v_~y$mem_tmp~0_156)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_135) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_135)) (not .cse25) (= |v_ULTIMATE.start_main_#t~mem42#1_211| |v_ULTIMATE.start_main_#t~ite43#1_208|)))) (not .cse23)))) (= v_~weak$$choice2~0_202 |v_ULTIMATE.start_main_#t~nondet37#1_139|) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51|) (= |v_#memory_int_742| (store .cse26 |v_~#y~0.base_360| (store .cse11 |v_~#y~0.offset_358| |v_ULTIMATE.start_main_#t~ite47#1_159|))) (= (ite .cse27 0 v_~y$r_buff0_thd3~0_116) v_~y$r_buff0_thd3~0_115) (= (store |v_#length_141| |v_ULTIMATE.start_main_~#t2228~0#1.base_41| 4) |v_#length_140|) (= v_~y$r_buff0_thd0~0_266 (ite .cse1 .cse28 (ite (or .cse13 .cse18 (and .cse16 .cse29)) .cse28 (ite (and .cse30 (not .cse13)) 0 .cse28)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_57|) (let ((.cse31 (= |v_ULTIMATE.start_main_#t~mem33#1_164| |v_ULTIMATE.start_main_#t~mem33#1_162|))) (or (and .cse31 (= |v_ULTIMATE.start_main_#t~ite34#1_157| |v_ULTIMATE.start_main_#t~ite34#1_155|) .cse32 (= v_~y$mem_tmp~0_156 v_~y$w_buff0~0_370) .cse33) (and (or (and (or .cse34 .cse35) (= |v_P2_#t~ite21_67| |v_ULTIMATE.start_main_#t~mem33#1_162|) (= |v_ULTIMATE.start_main_#t~ite34#1_155| |v_ULTIMATE.start_main_#t~mem33#1_162|)) (and .cse31 .cse36 (= v_~y$w_buff1~0_379 |v_ULTIMATE.start_main_#t~ite34#1_155|) .cse37)) (or .cse38 .cse39) (= v_~y$mem_tmp~0_156 |v_ULTIMATE.start_main_#t~ite34#1_155|)))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_115 256) 0)) .cse32) (and .cse7 .cse37)) 0 v_~y$r_buff1_thd3~0_108) v_~y$r_buff1_thd3~0_107)))))))))))))))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_66|, ~#y~0.offset=|v_~#y~0.offset_358|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_572, ~#y~0.base=|v_~#y~0.base_360|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_66|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_209, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, #pthreadsForks=|v_#pthreadsForks_118|, ~y$w_buff0~0=v_~y$w_buff0~0_370, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_116, #length=|v_#length_141|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_138, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_102, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_43|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_157|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_139|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_135, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_131|, #StackHeapBarrier=|v_#StackHeapBarrier_65|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_164|, ~y$w_buff1~0=v_~y$w_buff1~0_379, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_210|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_207|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_267, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_213|, #valid=|v_#valid_161|, #memory_int=|v_#memory_int_744|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_135, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_139|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_262, ~x~0=v_~x~0_112, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_43|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} OutVars{ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_41|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_115|, ~y$mem_tmp~0=v_~y$mem_tmp~0_156, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_208, ~weak$$choice1~0=v_~weak$$choice1~0_186, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_107, #pthreadsForks=|v_#pthreadsForks_117|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_36|, ~y$flush_delayed~0=v_~y$flush_delayed~0_190, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_96|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_111, #length=|v_#length_140|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_102, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_43|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_41|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_87|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_132|, ~weak$$choice0~0=v_~weak$$choice0~0_200, #StackHeapBarrier=|v_#StackHeapBarrier_65|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_51|, ~y$w_buff1~0=v_~y$w_buff1~0_378, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_261, ~x~0=v_~x~0_112, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_43|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_57|, ~#y~0.offset=|v_~#y~0.offset_358|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_570, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, ~#y~0.base=|v_~#y~0.base_360|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_43, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_35|, ~y$w_buff0~0=v_~y$w_buff0~0_369, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_115, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_138, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_196|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_151|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_47|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_83|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_158|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_43, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_266, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_742|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_135, ~weak$$choice2~0=v_~weak$$choice2~0_202, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_546} AuxVars[|v_ULTIMATE.start_main_#t~ite43#1_208|, |v_P2_#t~mem19_70|, |v_ULTIMATE.start_main_#t~ite34#1_155|, |v_ULTIMATE.start_main_#t~mem42#1_211|, |v_ULTIMATE.start_main_#t~mem46#1_205|, |v_ULTIMATE.start_main_#t~ite47#1_159|, |v_P2_#t~ite20_67|, |v_P2_#t~ite21_67|, |v_ULTIMATE.start_main_#t~mem33#1_162|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2228~0#1.base, ~main$tmp_guard1~0, P2Thread1of1ForFork0_#t~ite20, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, #length, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ULTIMATE.start_main_~#t2228~0#1.offset, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #valid, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:04:43,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [848] L861-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse29 (= (mod v_~y$w_buff0_used~0_585 256) 0)) (.cse28 (= (mod v_~y$r_buff0_thd0~0_279 256) 0))) (let ((.cse21 (not .cse28)) (.cse22 (not .cse29))) (let ((.cse12 (ite (and .cse21 .cse22) 0 v_~y$w_buff0_used~0_585))) (let ((.cse15 (= (mod .cse12 256) 0))) (let ((.cse32 (not .cse15))) (let ((.cse33 (and .cse21 .cse32))) (let ((.cse27 (= (mod v_~y$r_buff1_thd0~0_274 256) 0)) (.cse26 (= (mod v_~y$w_buff1_used~0_561 256) 0)) (.cse17 (ite .cse33 0 v_~y$r_buff0_thd0~0_279))) (let ((.cse18 (= (mod .cse17 256) 0)) (.cse24 (not .cse26)) (.cse25 (not .cse27))) (let ((.cse20 (ite (or (and .cse24 .cse25) .cse33) 0 v_~y$w_buff1_used~0_561)) (.cse19 (not .cse18))) (let ((.cse16 (and .cse19 .cse32)) (.cse30 (= (mod .cse20 256) 0))) (let ((.cse4 (ite (or .cse16 (and (not .cse30) .cse25)) 0 v_~y$r_buff1_thd0~0_274))) (let ((.cse0 (let ((.cse31 (store |v_#memory_int_757| |v_~#y~0.base_366| (store (select |v_#memory_int_757| |v_~#y~0.base_366|) |v_~#y~0.offset_364| 1)))) (store .cse31 |v_ULTIMATE.start_main_~#t2228~0#1.base_43| (store (select .cse31 |v_ULTIMATE.start_main_~#t2228~0#1.base_43|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre31#1_138|)))) (.cse6 (= (mod .cse4 256) 0)) (.cse2 (= (mod v_~weak$$choice2~0_208 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_560 256) 0)) (.cse3 (not .cse2)) (.cse13 (and .cse6 .cse18)) (.cse14 (and .cse30 .cse18)) (.cse8 (= 0 (mod v_~y$w_buff0_used~0_584 256))) (.cse1 (select .cse0 |v_~#y~0.base_366|))) (and (= v_~weak$$choice2~0_208 |v_ULTIMATE.start_main_#t~nondet37#1_151|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (= |v_P2Thread1of1ForFork0_#in~arg.offset_47| v_P2Thread1of1ForFork0_~arg.offset_47) (= (store .cse0 |v_~#y~0.base_366| (store .cse1 |v_~#y~0.offset_364| |v_ULTIMATE.start_main_#t~ite47#1_175|)) |v_#memory_int_756|) (= (mod v_~main$tmp_guard0~0_112 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (ite (= (ite (not (and (= v_~y$mem_tmp~0_162 2) (= v_~__unbuffered_p2_EAX~0_117 1) (= v_~__unbuffered_p0_EBX~0_108 0) (= 2 v_~__unbuffered_p0_EAX~0_220))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_84) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_43| 0)) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|) (or (and .cse2 (= |v_ULTIMATE.start_main_#t~ite47#1_175| |v_ULTIMATE.start_main_#t~mem46#1_227|) (= v_~y$mem_tmp~0_162 |v_ULTIMATE.start_main_#t~mem46#1_227|)) (and (= v_~y$mem_tmp~0_162 |v_ULTIMATE.start_main_#t~ite47#1_175|) (= |v_ULTIMATE.start_main_#t~mem46#1_229| |v_ULTIMATE.start_main_#t~mem46#1_227|) .cse3)) (= v_~y$flush_delayed~0_196 0) (= v_~y$r_buff1_thd0~0_273 (ite .cse3 .cse4 (ite (let ((.cse5 (= 0 (mod v_~y$r_buff0_thd0~0_278 256)))) (or (and .cse5 .cse6) (and .cse5 .cse7) .cse8)) .cse4 0))) (= |v_#pthreadsForks_122| |v_ULTIMATE.start_main_#t~pre31#1_138|) (= v_~__unbuffered_p2_EAX~0_117 v_~x~0_116) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem42#1_235| |v_ULTIMATE.start_main_#t~mem42#1_233|)) (.cse9 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256)))) (or (and (not .cse9) (let ((.cse11 (= (mod v_~weak$$choice1~0_192 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_230| v_~__unbuffered_p0_EAX~0_221) .cse10 .cse11) (and (not .cse11) (= (select (select (store .cse0 |v_~#y~0.base_366| (store .cse1 |v_~#y~0.offset_364| v_~y$mem_tmp~0_162)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141) |v_ULTIMATE.start_main_#t~mem42#1_233|) (= |v_ULTIMATE.start_main_#t~mem42#1_233| |v_ULTIMATE.start_main_#t~ite43#1_230|)))) (= |v_ULTIMATE.start_main_#t~ite43#1_230| v_~__unbuffered_p0_EAX~0_220)) (and (= v_~__unbuffered_p0_EAX~0_221 v_~__unbuffered_p0_EAX~0_220) .cse10 .cse9 (= |v_ULTIMATE.start_main_#t~ite43#1_232| |v_ULTIMATE.start_main_#t~ite43#1_230|)))) (= (store |v_#valid_165| |v_ULTIMATE.start_main_~#t2228~0#1.base_43| 1) |v_#valid_164|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_819 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_112) (= (+ |v_#pthreadsForks_122| 1) |v_#pthreadsForks_121|) (= |v_P2Thread1of1ForFork0_#in~arg.base_47| v_P2Thread1of1ForFork0_~arg.base_47) (= v_~y$w_buff0_used~0_584 (ite .cse3 .cse12 (ite (or .cse13 .cse14 .cse15) .cse12 (ite .cse16 0 .cse12)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| 0)) (= |v_ULTIMATE.start_main_#t~nondet36#1_151| v_~weak$$choice0~0_206) (= (store |v_#length_145| |v_ULTIMATE.start_main_~#t2228~0#1.base_43| 4) |v_#length_144|) (= v_~y$r_buff0_thd0~0_278 (ite .cse3 .cse17 (ite (or (and .cse7 .cse18) .cse13 .cse8) .cse17 (ite (and .cse19 (not .cse8)) 0 .cse17)))) (= (ite .cse3 .cse20 (ite (or .cse13 .cse14 .cse8) .cse20 0)) v_~y$w_buff1_used~0_560) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (< |v_#StackHeapBarrier_67| |v_ULTIMATE.start_main_~#t2228~0#1.base_43|) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_43|) (let ((.cse23 (= |v_ULTIMATE.start_main_#t~mem33#1_186| |v_ULTIMATE.start_main_#t~mem33#1_184|))) (or (and (= |v_ULTIMATE.start_main_#t~ite34#1_179| |v_ULTIMATE.start_main_#t~ite34#1_177|) .cse21 (= v_~y$mem_tmp~0_162 v_~y$w_buff0~0_382) .cse22 .cse23) (and (or (and .cse24 (= v_~y$w_buff1~0_391 |v_ULTIMATE.start_main_#t~ite34#1_177|) .cse23 .cse25) (and (= |v_ULTIMATE.start_main_#t~ite34#1_177| |v_ULTIMATE.start_main_#t~mem33#1_184|) (= |v_ULTIMATE.start_main_#t~mem33#1_184| (select .cse1 |v_~#y~0.offset_364|)) (or .cse26 .cse27))) (= v_~y$mem_tmp~0_162 |v_ULTIMATE.start_main_#t~ite34#1_177|) (or .cse28 .cse29)))) (= (select |v_#valid_165| |v_ULTIMATE.start_main_~#t2228~0#1.base_43|) 0) (= v_~y$w_buff1~0_391 v_~y$w_buff1~0_390) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= v_~weak$$choice1~0_192 |v_ULTIMATE.start_main_#t~nondet41#1_143|) (= v_~y$w_buff0~0_382 v_~y$w_buff0~0_381))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_364|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_585, ~#y~0.base=|v_~#y~0.base_366|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_221, #pthreadsForks=|v_#pthreadsForks_122|, ~y$w_buff0~0=v_~y$w_buff0~0_382, #length=|v_#length_145|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_108, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_47|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_179|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_151|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_143|, #StackHeapBarrier=|v_#StackHeapBarrier_67|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_186|, ~y$w_buff1~0=v_~y$w_buff1~0_391, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_232|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_229|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_279, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_235|, #valid=|v_#valid_165|, #memory_int=|v_#memory_int_757|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_151|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_819, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_116, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_47|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561} OutVars{ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_43|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_121|, ~y$mem_tmp~0=v_~y$mem_tmp~0_162, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_220, ~weak$$choice1~0=v_~weak$$choice1~0_192, #pthreadsForks=|v_#pthreadsForks_121|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_38|, ~y$flush_delayed~0=v_~y$flush_delayed~0_196, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_102|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, #length=|v_#length_144|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_108, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_47|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_43|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_93|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_138|, ~weak$$choice0~0=v_~weak$$choice0~0_206, #StackHeapBarrier=|v_#StackHeapBarrier_67|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~y$w_buff1~0=v_~y$w_buff1~0_390, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_115|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_819, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_273, ~x~0=v_~x~0_116, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_47|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~#y~0.offset=|v_~#y~0.offset_364|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_584, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~#y~0.base=|v_~#y~0.base_366|, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_47, ~y$w_buff0~0=v_~y$w_buff0~0_381, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_93|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_202|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_157|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_49|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_89|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_174|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_112, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_141, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_278, #valid=|v_#valid_164|, #memory_int=|v_#memory_int_756|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_141, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_560, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[|v_ULTIMATE.start_main_#t~ite47#1_175|, |v_ULTIMATE.start_main_#t~mem42#1_233|, |v_ULTIMATE.start_main_#t~mem46#1_227|, |v_ULTIMATE.start_main_#t~ite34#1_177|, |v_ULTIMATE.start_main_#t~ite43#1_230|, |v_ULTIMATE.start_main_#t~mem33#1_184|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2228~0#1.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, #length, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ULTIMATE.start_main_~#t2228~0#1.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #valid, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_#t~nondet32#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [837] $Ultimate##0-->L837: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd4~0_88 256) 0))) (let ((.cse5 (= (mod v_~y$w_buff0_used~0_518 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd4~0_76 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_497 256) 0)) (.cse9 (not .cse4)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_517 256) 0)))) (let ((.cse3 (and .cse9 .cse1)) (.cse2 (not .cse7)) (.cse0 (not .cse8)) (.cse10 (not .cse5))) (and (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_496 256) 0)) .cse0) (and (not (= (mod v_~y$r_buff0_thd4~0_87 256) 0)) .cse1)) 0 v_~y$r_buff1_thd4~0_76) v_~y$r_buff1_thd4~0_75) (= v_~y$w_buff1_used~0_496 (ite (or (and .cse2 .cse0) .cse3) 0 v_~y$w_buff1_used~0_497)) (= v_P3Thread1of1ForFork2_~arg.offset_29 |v_P3Thread1of1ForFork2_#in~arg.offset_29|) (= |v_P3Thread1of1ForFork2_#in~arg.base_29| v_P3Thread1of1ForFork2_~arg.base_29) (= v_~y$r_buff0_thd4~0_87 (ite .cse3 0 v_~y$r_buff0_thd4~0_88)) (let ((.cse6 (= |v_P3Thread1of1ForFork2_#t~mem22_34| |v_P3_#t~mem22_49|))) (or (and (or .cse4 .cse5) (= |v_P3_#t~ite23_44| |v_P3_#t~ite24_46|) (or (and .cse2 .cse0 (= |v_P3_#t~ite23_44| v_~y$w_buff1~0_329) .cse6) (and (or .cse7 .cse8) (= |v_P3_#t~ite23_44| |v_P3_#t~mem22_49|) (= 2 |v_P3_#t~mem22_49|)))) (and .cse9 (= |v_P3_#t~ite23_44| |v_P3Thread1of1ForFork2_#t~ite23_34|) (= |v_P3_#t~ite24_46| v_~y$w_buff0~0_323) .cse6 .cse10))) (= (store |v_#memory_int_677| |v_~#y~0.base_332| (store (select |v_#memory_int_677| |v_~#y~0.base_332|) |v_~#y~0.offset_330| |v_P3_#t~ite24_46|)) |v_#memory_int_675|) (= v_~y$w_buff0_used~0_517 (ite (and .cse9 .cse10) 0 v_~y$w_buff0_used~0_518)))))) InVars {~#y~0.offset=|v_~#y~0.offset_330|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_518, ~#y~0.base=|v_~#y~0.base_332|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_29|, P3Thread1of1ForFork2_#t~mem22=|v_P3Thread1of1ForFork2_#t~mem22_34|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_88, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_76, ~y$w_buff1~0=v_~y$w_buff1~0_329, ~y$w_buff0~0=v_~y$w_buff0~0_323, #memory_int=|v_#memory_int_677|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_29|, P3Thread1of1ForFork2_#t~ite23=|v_P3Thread1of1ForFork2_#t~ite23_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} OutVars{~#y~0.offset=|v_~#y~0.offset_330|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_517, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_29, ~#y~0.base=|v_~#y~0.base_332|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_29, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_29|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_87, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_75, ~y$w_buff1~0=v_~y$w_buff1~0_329, ~y$w_buff0~0=v_~y$w_buff0~0_323, #memory_int=|v_#memory_int_675|, P3Thread1of1ForFork2_#t~ite24=|v_P3Thread1of1ForFork2_#t~ite24_19|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_29|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_496} AuxVars[|v_P3_#t~mem22_49|, |v_P3_#t~ite23_44|, |v_P3_#t~ite24_46|] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_#t~ite24, P3Thread1of1ForFork2_#t~ite23, P3Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0, P3Thread1of1ForFork2_#t~mem22] [2022-12-13 12:04:47,474 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [850] L861-3-->L837: Formula: (let ((.cse22 (= (mod v_~y$w_buff0_used~0_594 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd0~0_287 256) 0))) (let ((.cse24 (not .cse23)) (.cse25 (not .cse22))) (let ((.cse39 (ite (and .cse24 .cse25) 0 v_~y$w_buff0_used~0_594))) (let ((.cse40 (= (mod .cse39 256) 0))) (let ((.cse43 (not .cse40))) (let ((.cse44 (and .cse24 .cse43))) (let ((.cse32 (ite .cse44 0 v_~y$r_buff0_thd0~0_287)) (.cse21 (= 0 (mod v_~y$w_buff1_used~0_570 256))) (.cse20 (= 0 (mod v_~y$r_buff1_thd0~0_282 256)))) (let ((.cse17 (not .cse20)) (.cse18 (not .cse21)) (.cse33 (= (mod .cse32 256) 0))) (let ((.cse35 (not .cse33)) (.cse37 (ite (or (and .cse17 .cse18) .cse44) 0 v_~y$w_buff1_used~0_570))) (let ((.cse42 (= (mod .cse37 256) 0)) (.cse41 (and .cse43 .cse35))) (let ((.cse28 (ite (or (and .cse17 (not .cse42)) .cse41) 0 v_~y$r_buff1_thd0~0_282))) (let ((.cse30 (= (mod .cse28 256) 0)) (.cse27 (= (mod v_~weak$$choice2~0_212 256) 0))) (let ((.cse26 (not .cse27)) (.cse38 (and .cse33 .cse42)) (.cse34 (and .cse33 .cse30))) (let ((.cse31 (ite .cse26 .cse39 (ite (or .cse40 .cse38 .cse34) .cse39 (ite .cse41 0 .cse39))))) (let ((.cse7 (= (mod .cse31 256) 0))) (let ((.cse16 (ite .cse26 .cse37 (ite (or .cse7 .cse38 .cse34) .cse37 0))) (.cse8 (= (mod v_~y$r_buff0_thd4~0_96 256) 0))) (let ((.cse11 (not (= (mod v_~y$w_buff0_used~0_592 256) 0))) (.cse1 (not .cse8)) (.cse9 (let ((.cse36 (store |v_#memory_int_766| |v_~#y~0.base_370| (store (select |v_#memory_int_766| |v_~#y~0.base_370|) |v_~#y~0.offset_368| 1)))) (store .cse36 |v_ULTIMATE.start_main_~#t2228~0#1.base_47| (store (select .cse36 |v_ULTIMATE.start_main_~#t2228~0#1.base_47|) |v_ULTIMATE.start_main_~#t2228~0#1.offset_47| |v_ULTIMATE.start_main_#t~pre31#1_146|)))) (.cse4 (= (mod v_~y$r_buff1_thd4~0_84 256) 0)) (.cse3 (= (mod .cse16 256) 0))) (let ((.cse5 (not .cse3)) (.cse6 (not .cse4)) (.cse10 (select .cse9 |v_~#y~0.base_370|)) (.cse0 (not .cse7)) (.cse15 (and .cse11 .cse1))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_51| v_P2Thread1of1ForFork0_~arg.offset_51) (= v_P3Thread1of1ForFork2_~arg.offset_37 |v_P3Thread1of1ForFork2_#in~arg.offset_37|) (= v_~weak$$choice2~0_212 |v_ULTIMATE.start_main_#t~nondet37#1_159|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|) (= v_~weak$$choice1~0_196 |v_ULTIMATE.start_main_#t~nondet41#1_151|) (let ((.cse2 (= |v_P3Thread1of1ForFork2_#t~mem22_42| |v_P3_#t~mem22_53|))) (or (and .cse0 .cse1 (= |v_P3_#t~ite24_50| v_~y$w_buff0~0_389) .cse2 (= |v_P3_#t~ite23_48| |v_P3Thread1of1ForFork2_#t~ite23_42|)) (and (or (and (= |v_P3_#t~ite23_48| |v_P3_#t~mem22_53|) (= 2 |v_P3_#t~mem22_53|) (or .cse3 .cse4)) (and .cse2 .cse5 .cse6 (= |v_P3_#t~ite23_48| v_~y$w_buff1~0_398))) (= |v_P3_#t~ite23_48| |v_P3_#t~ite24_50|) (or .cse7 .cse8)))) (= |v_#memory_int_764| (store .cse9 |v_~#y~0.base_370| (store .cse10 |v_~#y~0.offset_368| |v_P3_#t~ite24_50|))) (= |v_ULTIMATE.start_main_#t~nondet36#1_159| v_~weak$$choice0~0_210) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_112 0) (= v_~y$mem_tmp~0_166 2) (= 2 v_~__unbuffered_p0_EAX~0_228) (= v_~__unbuffered_p2_EAX~0_121 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_88) (= v_~y$w_buff1~0_399 v_~y$w_buff1~0_398) (= v_~__unbuffered_p2_EAX~0_121 v_~x~0_120) (= (store |v_#length_153| |v_ULTIMATE.start_main_~#t2228~0#1.base_47| 4) |v_#length_152|) (= (ite (or (and .cse11 (not (= 0 (mod v_~y$r_buff0_thd4~0_95 256)))) (and (not (= (mod v_~y$w_buff1_used~0_568 256) 0)) .cse6)) 0 v_~y$r_buff1_thd4~0_84) v_~y$r_buff1_thd4~0_83) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (not (= |v_ULTIMATE.start_main_~#t2228~0#1.base_47| 0)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem42#1_247| |v_ULTIMATE.start_main_#t~mem42#1_245|)) (.cse13 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_148 256)))) (or (and (= v_~__unbuffered_p0_EAX~0_229 v_~__unbuffered_p0_EAX~0_228) (= |v_ULTIMATE.start_main_#t~ite43#1_244| |v_ULTIMATE.start_main_#t~ite43#1_242|) .cse12 .cse13) (and (let ((.cse14 (= 0 (mod v_~weak$$choice1~0_196 256)))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_245| (select (select (store .cse9 |v_~#y~0.base_370| (store .cse10 |v_~#y~0.offset_368| v_~y$mem_tmp~0_166)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_145) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_145)) (= |v_ULTIMATE.start_main_#t~mem42#1_245| |v_ULTIMATE.start_main_#t~ite43#1_242|) (not .cse14)) (and .cse14 (= |v_ULTIMATE.start_main_#t~ite43#1_242| v_~__unbuffered_p0_EAX~0_229) .cse12))) (= |v_ULTIMATE.start_main_#t~ite43#1_242| v_~__unbuffered_p0_EAX~0_228) (not .cse13)))) (= v_~y$w_buff1_used~0_568 (ite (or (and .cse5 .cse6) .cse15) 0 .cse16)) (= v_~main$tmp_guard0~0_116 (ite (= (ite (= v_~__unbuffered_cnt~0_823 4) 1 0) 0) 0 1)) (let ((.cse19 (= |v_ULTIMATE.start_main_#t~mem33#1_198| |v_ULTIMATE.start_main_#t~mem33#1_196|))) (or (and (or (and .cse17 .cse18 (= v_~y$w_buff1~0_399 |v_ULTIMATE.start_main_#t~ite34#1_189|) .cse19) (and (= |v_ULTIMATE.start_main_#t~ite34#1_189| |v_ULTIMATE.start_main_#t~mem33#1_196|) (= (select .cse10 |v_~#y~0.offset_368|) |v_ULTIMATE.start_main_#t~mem33#1_196|) (or .cse20 .cse21))) (or .cse22 .cse23) (= v_~y$mem_tmp~0_166 |v_ULTIMATE.start_main_#t~ite34#1_189|)) (and .cse24 (= |v_ULTIMATE.start_main_#t~ite34#1_189| |v_ULTIMATE.start_main_#t~ite34#1_191|) (= v_~y$mem_tmp~0_166 v_~y$w_buff0~0_390) .cse19 .cse25))) (= (mod v_~main$tmp_guard1~0_88 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= |v_P2Thread1of1ForFork0_#in~arg.base_51| v_P2Thread1of1ForFork0_~arg.base_51) (= 0 |v_ULTIMATE.start_main_~#t2228~0#1.offset_47|) (= v_~y$flush_delayed~0_200 0) (= (select |v_#valid_173| |v_ULTIMATE.start_main_~#t2228~0#1.base_47|) 0) (= (store |v_#valid_173| |v_ULTIMATE.start_main_~#t2228~0#1.base_47| 1) |v_#valid_172|) (or (and (= |v_ULTIMATE.start_main_#t~mem46#1_239| |v_ULTIMATE.start_main_#t~mem46#1_241|) .cse26 (= v_~y$mem_tmp~0_166 |v_ULTIMATE.start_main_#t~ite47#1_183|)) (and (= v_~y$mem_tmp~0_166 |v_ULTIMATE.start_main_#t~mem46#1_239|) .cse27 (= |v_ULTIMATE.start_main_#t~ite47#1_183| |v_ULTIMATE.start_main_#t~mem46#1_239|))) (= v_~y$r_buff1_thd0~0_281 (ite .cse26 .cse28 (ite (let ((.cse29 (= (mod v_~y$r_buff0_thd0~0_286 256) 0))) (or .cse7 (and .cse29 .cse3) (and .cse30 .cse29))) .cse28 0))) (= |v_#pthreadsForks_129| (+ |v_#pthreadsForks_130| 1)) (= (ite (and .cse0 .cse1) 0 .cse31) v_~y$w_buff0_used~0_592) (= v_~y$w_buff0~0_389 v_~y$w_buff0~0_390) (= v_~y$r_buff0_thd0~0_286 (ite .cse26 .cse32 (ite (or .cse7 (and .cse33 .cse3) .cse34) .cse32 (ite (and .cse0 .cse35) 0 .cse32)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_67| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_97|) (< |v_#StackHeapBarrier_71| |v_ULTIMATE.start_main_~#t2228~0#1.base_47|) (= (mod v_~main$tmp_guard0~0_116 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_97|) (= (ite .cse15 0 v_~y$r_buff0_thd4~0_96) v_~y$r_buff0_thd4~0_95) (= |v_#pthreadsForks_130| |v_ULTIMATE.start_main_#t~pre31#1_146|) (= |v_P3Thread1of1ForFork2_#in~arg.base_37| v_P3Thread1of1ForFork2_~arg.base_37)))))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_368|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_594, ~#y~0.base=|v_~#y~0.base_370|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_229, #pthreadsForks=|v_#pthreadsForks_130|, ~y$w_buff0~0=v_~y$w_buff0~0_390, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_37|, #length=|v_#length_153|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_148, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_112, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_51|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_191|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_159|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_145, P3Thread1of1ForFork2_#t~mem22=|v_P3Thread1of1ForFork2_#t~mem22_42|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_96, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_151|, #StackHeapBarrier=|v_#StackHeapBarrier_71|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_84, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_198|, ~y$w_buff1~0=v_~y$w_buff1~0_399, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_244|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_241|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_287, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_247|, #valid=|v_#valid_173|, #memory_int=|v_#memory_int_766|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_145, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_159|, P3Thread1of1ForFork2_#t~ite23=|v_P3Thread1of1ForFork2_#t~ite23_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_823, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_282, ~x~0=v_~x~0_120, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_51|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_570} OutVars{ULTIMATE.start_main_~#t2228~0#1.base=|v_ULTIMATE.start_main_~#t2228~0#1.base_47|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_125|, ~y$mem_tmp~0=v_~y$mem_tmp~0_166, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_228, ~weak$$choice1~0=v_~weak$$choice1~0_196, #pthreadsForks=|v_#pthreadsForks_129|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_42|, ~y$flush_delayed~0=v_~y$flush_delayed~0_200, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_37|, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_106|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_121, #length=|v_#length_152|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_112, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_51|, ULTIMATE.start_main_~#t2228~0#1.offset=|v_ULTIMATE.start_main_~#t2228~0#1.offset_47|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_37|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_97|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_146|, ~weak$$choice0~0=v_~weak$$choice0~0_210, #StackHeapBarrier=|v_#StackHeapBarrier_71|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_83, ~y$w_buff1~0=v_~y$w_buff1~0_398, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, P3Thread1of1ForFork2_#t~ite24=|v_P3Thread1of1ForFork2_#t~ite24_23|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_119|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_823, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_120, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_51|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_67|, ~#y~0.offset=|v_~#y~0.offset_368|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_592, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~#y~0.base=|v_~#y~0.base_370|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_37, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_51, ~y$w_buff0~0=v_~y$w_buff0~0_389, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_148, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_206|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_53|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_93|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_182|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_116, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_145, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_286, #valid=|v_#valid_172|, #memory_int=|v_#memory_int_764|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_145, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_568, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_97|} AuxVars[|v_ULTIMATE.start_main_#t~ite47#1_183|, |v_ULTIMATE.start_main_#t~ite34#1_189|, |v_P3_#t~ite23_48|, |v_ULTIMATE.start_main_#t~mem42#1_245|, |v_ULTIMATE.start_main_#t~mem46#1_239|, |v_ULTIMATE.start_main_#t~ite43#1_242|, |v_P3_#t~mem22_53|, |v_P3_#t~ite24_50|, |v_ULTIMATE.start_main_#t~mem33#1_196|] AssignedVars[ULTIMATE.start_main_~#t2228~0#1.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, #length, ULTIMATE.start_main_~#t2228~0#1.offset, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem42#1, P3Thread1of1ForFork2_#t~ite24, ULTIMATE.start_main_#t~nondet32#1, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork0_~arg.base, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ~main$tmp_guard0~0, P3Thread1of1ForFork2_#t~mem22, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet37#1, P3Thread1of1ForFork2_#t~ite23, ~weak$$choice2~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [696] L812-->L820: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd3~0_28 256) 0))) (let ((.cse0 (= (mod v_~y$w_buff0_used~0_215 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd3~0_28 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_214 256) 0))) (.cse9 (not .cse1)) (.cse4 (= (mod v_~y$w_buff1_used~0_190 256) 0))) (let ((.cse6 (not .cse4)) (.cse10 (and .cse11 .cse9)) (.cse2 (select |v_#memory_int_219| |v_~#y~0.base_154|)) (.cse7 (not .cse3)) (.cse8 (not .cse0))) (and (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem19_1| |v_P2_#t~mem19_36|))) (or (and (or .cse0 .cse1) (or (and (= |v_P2_#t~ite20_33| |v_P2_#t~mem19_36|) (= |v_P2_#t~mem19_36| (select .cse2 |v_~#y~0.offset_154|)) (or .cse3 .cse4)) (and .cse5 (= v_~y$w_buff1~0_100 |v_P2_#t~ite20_33|) .cse6 .cse7)) (= |v_P2_#t~ite20_33| |v_P2_#t~ite21_33|)) (and .cse5 (= |v_P2_#t~ite20_33| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse8 (= |v_P2_#t~ite21_33| v_~y$w_buff0~0_94) .cse9))) (= v_~y$w_buff1_used~0_189 (ite (or (and .cse6 .cse7) .cse10) 0 v_~y$w_buff1_used~0_190)) (= v_~y$r_buff0_thd3~0_27 (ite .cse10 0 v_~y$r_buff0_thd3~0_28)) (= (store |v_#memory_int_219| |v_~#y~0.base_154| (store .cse2 |v_~#y~0.offset_154| |v_P2_#t~ite21_33|)) |v_#memory_int_218|) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse7)) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27) (= v_~y$w_buff0_used~0_214 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_215)))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_215, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_219|, ~#y~0.base=|v_~#y~0.base_154|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~#y~0.offset=|v_~#y~0.offset_154|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_218|, ~#y~0.base=|v_~#y~0.base_154|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} AuxVars[|v_P2_#t~ite21_33|, |v_P2_#t~mem19_36|, |v_P2_#t~ite20_33|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork0_#t~ite20, ~y$w_buff1_used~0] [2022-12-13 12:04:54,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [846] L861-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_271 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_577 256) 0))) (let ((.cse0 (not .cse3)) (.cse2 (not .cse4))) (let ((.cse20 (ite (and .cse0 .cse2) 0 v_~y$w_buff0_used~0_577))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse2))) (let ((.cse8 (= 0 (mod v_~y$w_buff1_used~0_553 256))) (.cse7 (= (mod v_~y$r_buff1_thd0~0_266 256) 0)) (.cse26 (ite .cse31 0 v_~y$r_buff0_thd0~0_271))) (let ((.cse27 (= (mod .cse26 256) 0)) (.cse5 (not .cse7)) (.cse6 (not .cse8))) (let ((.cse25 (ite (or .cse31 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_553)) (.cse28 (not .cse27))) (let ((.cse24 (and .cse28 .cse30)) (.cse29 (= (mod .cse25 256) 0))) (let ((.cse15 (ite (or .cse24 (and (not .cse29) .cse5)) 0 v_~y$r_buff1_thd0~0_266))) (let ((.cse17 (= (mod .cse15 256) 0)) (.cse13 (= (mod v_~weak$$choice2~0_204 256) 0))) (let ((.cse9 (select |v_#memory_int_749| |v_~#y~0.base_362|)) (.cse22 (and .cse27 .cse29)) (.cse14 (not .cse13)) (.cse21 (and .cse27 .cse17)) (.cse18 (= (mod v_~y$w_buff1_used~0_552 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_576 256) 0))) (and (let ((.cse1 (= |v_ULTIMATE.start_main_#t~mem33#1_174| |v_ULTIMATE.start_main_#t~mem33#1_172|))) (or (and (= v_~y$mem_tmp~0_158 v_~y$w_buff0~0_374) .cse0 (= |v_ULTIMATE.start_main_#t~ite34#1_167| |v_ULTIMATE.start_main_#t~ite34#1_165|) .cse1 .cse2) (and (or .cse3 .cse4) (or (and .cse1 (= v_~y$w_buff1~0_383 |v_ULTIMATE.start_main_#t~ite34#1_165|) .cse5 .cse6) (and (or .cse7 .cse8) (= 2 |v_ULTIMATE.start_main_#t~mem33#1_172|))) (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite34#1_165|)))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_815 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_108) (= |v_P2Thread1of1ForFork0_#in~arg.offset_45| v_P2Thread1of1ForFork0_~arg.offset_45) (= v_~__unbuffered_p2_EAX~0_113 v_~x~0_114) (= (store |v_#memory_int_749| |v_~#y~0.base_362| (store .cse9 |v_~#y~0.offset_360| |v_ULTIMATE.start_main_#t~ite47#1_167|)) |v_#memory_int_748|) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem42#1_223| |v_ULTIMATE.start_main_#t~mem42#1_221|)) (.cse11 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and .cse10 (= |v_ULTIMATE.start_main_#t~ite43#1_218| |v_ULTIMATE.start_main_#t~ite43#1_220|) (= v_~__unbuffered_p0_EAX~0_213 v_~__unbuffered_p0_EAX~0_212) .cse11) (and (let ((.cse12 (= (mod v_~weak$$choice1~0_188 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_221| |v_ULTIMATE.start_main_#t~ite43#1_218|) (not .cse12) (= |v_ULTIMATE.start_main_#t~mem42#1_221| (select (select (store |v_#memory_int_749| |v_~#y~0.base_362| (store .cse9 |v_~#y~0.offset_360| v_~y$mem_tmp~0_158)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_137) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_137))) (and .cse10 .cse12 (= |v_ULTIMATE.start_main_#t~ite43#1_218| v_~__unbuffered_p0_EAX~0_213)))) (not .cse11) (= |v_ULTIMATE.start_main_#t~ite43#1_218| v_~__unbuffered_p0_EAX~0_212)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| 0)) (= v_~y$flush_delayed~0_192 0) (= v_~y$w_buff0~0_374 v_~y$w_buff0~0_373) (= v_~y$w_buff1~0_383 v_~y$w_buff1~0_382) (= v_~weak$$choice2~0_204 |v_ULTIMATE.start_main_#t~nondet37#1_143|) (= |v_P3Thread1of1ForFork2_#in~arg.base_35| v_P3Thread1of1ForFork2_~arg.base_35) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (or (and (= |v_ULTIMATE.start_main_#t~ite47#1_167| |v_ULTIMATE.start_main_#t~mem46#1_215|) .cse13 (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~mem46#1_215|)) (and (= |v_ULTIMATE.start_main_#t~mem46#1_217| |v_ULTIMATE.start_main_#t~mem46#1_215|) (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite47#1_167|) .cse14)) (= v_~y$r_buff1_thd0~0_265 (ite .cse14 .cse15 (ite (let ((.cse16 (= (mod v_~y$r_buff0_thd0~0_270 256) 0))) (or (and .cse16 .cse17) (and .cse18 .cse16) .cse19)) .cse15 0))) (= |v_P2Thread1of1ForFork0_#in~arg.base_45| v_P2Thread1of1ForFork0_~arg.base_45) (= |v_ULTIMATE.start_main_#t~nondet36#1_143| v_~weak$$choice0~0_202) (= v_P3Thread1of1ForFork2_~arg.offset_35 |v_P3Thread1of1ForFork2_#in~arg.offset_35|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_212) (= v_~y$mem_tmp~0_158 2) (= v_~__unbuffered_p2_EAX~0_113 1) (= v_~__unbuffered_p0_EBX~0_104 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_80) (= v_~y$w_buff0_used~0_576 (ite .cse14 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= (ite .cse14 .cse25 (ite (or .cse21 .cse19 .cse22) .cse25 0)) v_~y$w_buff1_used~0_552) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53| (mod v_~main$tmp_guard1~0_80 256)) (= v_~weak$$choice1~0_188 |v_ULTIMATE.start_main_#t~nondet41#1_135|) (= v_~y$r_buff0_thd0~0_270 (ite .cse14 .cse26 (ite (or .cse21 .cse19 (and .cse27 .cse18)) .cse26 (ite (and (not .cse19) .cse28) 0 .cse26)))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_360|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_577, ~#y~0.base=|v_~#y~0.base_362|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_213, ~y$w_buff0~0=v_~y$w_buff0~0_374, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_35|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_45|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_167|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_143|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_137, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_35|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_135|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_174|, ~y$w_buff1~0=v_~y$w_buff1~0_383, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_220|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_217|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_271, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_223|, #memory_int=|v_#memory_int_749|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_137, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_143|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_815, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_266, ~x~0=v_~x~0_114, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_45|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_553} OutVars{ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_117|, ~y$mem_tmp~0=v_~y$mem_tmp~0_158, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_212, ~weak$$choice1~0=v_~weak$$choice1~0_188, ~y$flush_delayed~0=v_~y$flush_delayed~0_192, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_98|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_45|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_35|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_89|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_134|, ~weak$$choice0~0=v_~weak$$choice0~0_202, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53|, ~y$w_buff1~0=v_~y$w_buff1~0_382, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_111|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_815, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~x~0=v_~x~0_114, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_45|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~#y~0.offset=|v_~#y~0.offset_360|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_576, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~#y~0.base=|v_~#y~0.base_362|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_35, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_45, ~y$w_buff0~0=v_~y$w_buff0~0_373, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_89|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_198|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_85|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_166|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_270, #memory_int=|v_#memory_int_748|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_137, ~weak$$choice2~0=v_~weak$$choice2~0_204, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_552, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem42#1_221|, |v_ULTIMATE.start_main_#t~ite43#1_218|, |v_ULTIMATE.start_main_#t~ite47#1_167|, |v_ULTIMATE.start_main_#t~ite34#1_165|, |v_ULTIMATE.start_main_#t~mem46#1_215|, |v_ULTIMATE.start_main_#t~mem33#1_172|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_#t~nondet32#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [696] L812-->L820: Formula: (let ((.cse1 (= (mod v_~y$r_buff0_thd3~0_28 256) 0))) (let ((.cse0 (= (mod v_~y$w_buff0_used~0_215 256) 0)) (.cse3 (= (mod v_~y$r_buff1_thd3~0_28 256) 0)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_214 256) 0))) (.cse9 (not .cse1)) (.cse4 (= (mod v_~y$w_buff1_used~0_190 256) 0))) (let ((.cse6 (not .cse4)) (.cse10 (and .cse11 .cse9)) (.cse2 (select |v_#memory_int_219| |v_~#y~0.base_154|)) (.cse7 (not .cse3)) (.cse8 (not .cse0))) (and (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem19_1| |v_P2_#t~mem19_36|))) (or (and (or .cse0 .cse1) (or (and (= |v_P2_#t~ite20_33| |v_P2_#t~mem19_36|) (= |v_P2_#t~mem19_36| (select .cse2 |v_~#y~0.offset_154|)) (or .cse3 .cse4)) (and .cse5 (= v_~y$w_buff1~0_100 |v_P2_#t~ite20_33|) .cse6 .cse7)) (= |v_P2_#t~ite20_33| |v_P2_#t~ite21_33|)) (and .cse5 (= |v_P2_#t~ite20_33| |v_P2Thread1of1ForFork0_#t~ite20_1|) .cse8 (= |v_P2_#t~ite21_33| v_~y$w_buff0~0_94) .cse9))) (= v_~y$w_buff1_used~0_189 (ite (or (and .cse6 .cse7) .cse10) 0 v_~y$w_buff1_used~0_190)) (= v_~y$r_buff0_thd3~0_27 (ite .cse10 0 v_~y$r_buff0_thd3~0_28)) (= (store |v_#memory_int_219| |v_~#y~0.base_154| (store .cse2 |v_~#y~0.offset_154| |v_P2_#t~ite21_33|)) |v_#memory_int_218|) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd3~0_27 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_189 256) 0)) .cse7)) 0 v_~y$r_buff1_thd3~0_28) v_~y$r_buff1_thd3~0_27) (= v_~y$w_buff0_used~0_214 (ite (and .cse8 .cse9) 0 v_~y$w_buff0_used~0_215)))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_28, ~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_215, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_219|, ~#y~0.base=|v_~#y~0.base_154|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_190} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_27, ~#y~0.offset=|v_~#y~0.offset_154|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_100, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_94, #memory_int=|v_#memory_int_218|, ~#y~0.base=|v_~#y~0.base_154|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} AuxVars[|v_P2_#t~ite21_33|, |v_P2_#t~mem19_36|, |v_P2_#t~ite20_33|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork0_#t~ite20, ~y$w_buff1_used~0] [2022-12-13 12:04:56,859 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [846] L861-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_271 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_577 256) 0))) (let ((.cse0 (not .cse3)) (.cse2 (not .cse4))) (let ((.cse20 (ite (and .cse0 .cse2) 0 v_~y$w_buff0_used~0_577))) (let ((.cse23 (= (mod .cse20 256) 0))) (let ((.cse30 (not .cse23))) (let ((.cse31 (and .cse30 .cse2))) (let ((.cse8 (= 0 (mod v_~y$w_buff1_used~0_553 256))) (.cse7 (= (mod v_~y$r_buff1_thd0~0_266 256) 0)) (.cse26 (ite .cse31 0 v_~y$r_buff0_thd0~0_271))) (let ((.cse27 (= (mod .cse26 256) 0)) (.cse5 (not .cse7)) (.cse6 (not .cse8))) (let ((.cse25 (ite (or .cse31 (and .cse5 .cse6)) 0 v_~y$w_buff1_used~0_553)) (.cse28 (not .cse27))) (let ((.cse24 (and .cse28 .cse30)) (.cse29 (= (mod .cse25 256) 0))) (let ((.cse15 (ite (or .cse24 (and (not .cse29) .cse5)) 0 v_~y$r_buff1_thd0~0_266))) (let ((.cse17 (= (mod .cse15 256) 0)) (.cse13 (= (mod v_~weak$$choice2~0_204 256) 0))) (let ((.cse9 (select |v_#memory_int_749| |v_~#y~0.base_362|)) (.cse22 (and .cse27 .cse29)) (.cse14 (not .cse13)) (.cse21 (and .cse27 .cse17)) (.cse18 (= (mod v_~y$w_buff1_used~0_552 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_576 256) 0))) (and (let ((.cse1 (= |v_ULTIMATE.start_main_#t~mem33#1_174| |v_ULTIMATE.start_main_#t~mem33#1_172|))) (or (and (= v_~y$mem_tmp~0_158 v_~y$w_buff0~0_374) .cse0 (= |v_ULTIMATE.start_main_#t~ite34#1_167| |v_ULTIMATE.start_main_#t~ite34#1_165|) .cse1 .cse2) (and (or .cse3 .cse4) (or (and .cse1 (= v_~y$w_buff1~0_383 |v_ULTIMATE.start_main_#t~ite34#1_165|) .cse5 .cse6) (and (or .cse7 .cse8) (= 2 |v_ULTIMATE.start_main_#t~mem33#1_172|))) (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite34#1_165|)))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_815 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_108) (= |v_P2Thread1of1ForFork0_#in~arg.offset_45| v_P2Thread1of1ForFork0_~arg.offset_45) (= v_~__unbuffered_p2_EAX~0_113 v_~x~0_114) (= (store |v_#memory_int_749| |v_~#y~0.base_362| (store .cse9 |v_~#y~0.offset_360| |v_ULTIMATE.start_main_#t~ite47#1_167|)) |v_#memory_int_748|) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem42#1_223| |v_ULTIMATE.start_main_#t~mem42#1_221|)) (.cse11 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and .cse10 (= |v_ULTIMATE.start_main_#t~ite43#1_218| |v_ULTIMATE.start_main_#t~ite43#1_220|) (= v_~__unbuffered_p0_EAX~0_213 v_~__unbuffered_p0_EAX~0_212) .cse11) (and (let ((.cse12 (= (mod v_~weak$$choice1~0_188 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_221| |v_ULTIMATE.start_main_#t~ite43#1_218|) (not .cse12) (= |v_ULTIMATE.start_main_#t~mem42#1_221| (select (select (store |v_#memory_int_749| |v_~#y~0.base_362| (store .cse9 |v_~#y~0.offset_360| v_~y$mem_tmp~0_158)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_137) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_137))) (and .cse10 .cse12 (= |v_ULTIMATE.start_main_#t~ite43#1_218| v_~__unbuffered_p0_EAX~0_213)))) (not .cse11) (= |v_ULTIMATE.start_main_#t~ite43#1_218| v_~__unbuffered_p0_EAX~0_212)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| 0)) (= v_~y$flush_delayed~0_192 0) (= v_~y$w_buff0~0_374 v_~y$w_buff0~0_373) (= v_~y$w_buff1~0_383 v_~y$w_buff1~0_382) (= v_~weak$$choice2~0_204 |v_ULTIMATE.start_main_#t~nondet37#1_143|) (= |v_P3Thread1of1ForFork2_#in~arg.base_35| v_P3Thread1of1ForFork2_~arg.base_35) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (or (and (= |v_ULTIMATE.start_main_#t~ite47#1_167| |v_ULTIMATE.start_main_#t~mem46#1_215|) .cse13 (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~mem46#1_215|)) (and (= |v_ULTIMATE.start_main_#t~mem46#1_217| |v_ULTIMATE.start_main_#t~mem46#1_215|) (= v_~y$mem_tmp~0_158 |v_ULTIMATE.start_main_#t~ite47#1_167|) .cse14)) (= v_~y$r_buff1_thd0~0_265 (ite .cse14 .cse15 (ite (let ((.cse16 (= (mod v_~y$r_buff0_thd0~0_270 256) 0))) (or (and .cse16 .cse17) (and .cse18 .cse16) .cse19)) .cse15 0))) (= |v_P2Thread1of1ForFork0_#in~arg.base_45| v_P2Thread1of1ForFork0_~arg.base_45) (= |v_ULTIMATE.start_main_#t~nondet36#1_143| v_~weak$$choice0~0_202) (= v_P3Thread1of1ForFork2_~arg.offset_35 |v_P3Thread1of1ForFork2_#in~arg.offset_35|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_212) (= v_~y$mem_tmp~0_158 2) (= v_~__unbuffered_p2_EAX~0_113 1) (= v_~__unbuffered_p0_EBX~0_104 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_80) (= v_~y$w_buff0_used~0_576 (ite .cse14 .cse20 (ite (or .cse21 .cse22 .cse23) .cse20 (ite .cse24 0 .cse20)))) (= (ite .cse14 .cse25 (ite (or .cse21 .cse19 .cse22) .cse25 0)) v_~y$w_buff1_used~0_552) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53| (mod v_~main$tmp_guard1~0_80 256)) (= v_~weak$$choice1~0_188 |v_ULTIMATE.start_main_#t~nondet41#1_135|) (= v_~y$r_buff0_thd0~0_270 (ite .cse14 .cse26 (ite (or .cse21 .cse19 (and .cse27 .cse18)) .cse26 (ite (and (not .cse19) .cse28) 0 .cse26)))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_360|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_577, ~#y~0.base=|v_~#y~0.base_362|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_213, ~y$w_buff0~0=v_~y$w_buff0~0_374, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_35|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_45|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_167|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_143|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_137, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_35|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_135|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_174|, ~y$w_buff1~0=v_~y$w_buff1~0_383, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_220|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_217|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_271, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_223|, #memory_int=|v_#memory_int_749|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_137, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_143|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_815, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_266, ~x~0=v_~x~0_114, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_45|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_553} OutVars{ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_117|, ~y$mem_tmp~0=v_~y$mem_tmp~0_158, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_212, ~weak$$choice1~0=v_~weak$$choice1~0_188, ~y$flush_delayed~0=v_~y$flush_delayed~0_192, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_98|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_104, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_45|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_35|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_89|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_134|, ~weak$$choice0~0=v_~weak$$choice0~0_202, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_53|, ~y$w_buff1~0=v_~y$w_buff1~0_382, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_111|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_815, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_265, ~x~0=v_~x~0_114, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_45|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_59|, ~#y~0.offset=|v_~#y~0.offset_360|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_576, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~#y~0.base=|v_~#y~0.base_362|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_35, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_45, ~y$w_buff0~0=v_~y$w_buff0~0_373, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_89|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_198|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_85|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_166|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_270, #memory_int=|v_#memory_int_748|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_137, ~weak$$choice2~0=v_~weak$$choice2~0_204, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_552, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem42#1_221|, |v_ULTIMATE.start_main_#t~ite43#1_218|, |v_ULTIMATE.start_main_#t~ite47#1_167|, |v_ULTIMATE.start_main_#t~ite34#1_165|, |v_ULTIMATE.start_main_#t~mem46#1_215|, |v_ULTIMATE.start_main_#t~mem33#1_172|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_#t~nondet32#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [702] L829-->L837: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd4~0_32 256) 0))) (let ((.cse8 (= (mod v_~y$r_buff1_thd4~0_30 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_174 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_200 256) 0))) (.cse10 (= (mod v_~y$w_buff0_used~0_201 256) 0))) (let ((.cse2 (select |v_#memory_int_201| |v_~#y~0.base_144|)) (.cse1 (not .cse10)) (.cse3 (and .cse0 .cse11)) (.cse6 (not .cse7)) (.cse4 (not .cse8))) (and (= v_~y$w_buff0_used~0_200 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_201)) (= (store |v_#memory_int_201| |v_~#y~0.base_144| (store .cse2 |v_~#y~0.offset_144| |v_P3_#t~ite24_29|)) |v_#memory_int_200|) (= (ite .cse3 0 v_~y$r_buff0_thd4~0_32) v_~y$r_buff0_thd4~0_31) (let ((.cse5 (= |v_P3_#t~mem22_32| |v_P3Thread1of1ForFork2_#t~mem22_1|))) (or (and (or (and .cse4 (= |v_P3_#t~ite23_27| v_~y$w_buff1~0_86) .cse5 .cse6) (and (or .cse7 .cse8) (= |v_P3_#t~ite23_27| |v_P3_#t~mem22_32|) (= (select .cse2 |v_~#y~0.offset_144|) |v_P3_#t~mem22_32|))) (or .cse9 .cse10) (= |v_P3_#t~ite23_27| |v_P3_#t~ite24_29|)) (and (= |v_P3_#t~ite24_29| v_~y$w_buff0~0_84) .cse0 (= |v_P3Thread1of1ForFork2_#t~ite23_1| |v_P3_#t~ite23_27|) .cse5 .cse1))) (= v_~y$w_buff1_used~0_173 (ite (or .cse3 (and .cse4 .cse6)) 0 v_~y$w_buff1_used~0_174)) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd4~0_31 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) 0 v_~y$r_buff1_thd4~0_30) v_~y$r_buff1_thd4~0_29))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_30, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_201|, P3Thread1of1ForFork2_#t~ite23=|v_P3Thread1of1ForFork2_#t~ite23_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174, P3Thread1of1ForFork2_#t~mem22=|v_P3Thread1of1ForFork2_#t~mem22_1|} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_31, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_29, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_200|, P3Thread1of1ForFork2_#t~ite24=|v_P3Thread1of1ForFork2_#t~ite24_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} AuxVars[|v_P3_#t~ite24_29|, |v_P3_#t~ite23_27|, |v_P3_#t~mem22_32|] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, #memory_int, P3Thread1of1ForFork2_#t~ite24, P3Thread1of1ForFork2_#t~ite23, ~y$w_buff1_used~0, P3Thread1of1ForFork2_#t~mem22] [2022-12-13 12:04:59,595 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [852] L861-3-->L820: Formula: (let ((.cse6 (= (mod v_~y$w_buff0_used~0_606 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd0~0_295 256) 0))) (let ((.cse7 (not .cse5)) (.cse8 (not .cse6))) (let ((.cse37 (ite (and .cse7 .cse8) 0 v_~y$w_buff0_used~0_606))) (let ((.cse38 (= (mod .cse37 256) 0))) (let ((.cse41 (not .cse38))) (let ((.cse42 (and .cse7 .cse41))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_582 256) 0)) (.cse4 (= (mod v_~y$r_buff1_thd0~0_290 256) 0)) (.cse30 (ite .cse42 0 v_~y$r_buff0_thd0~0_295))) (let ((.cse31 (= (mod .cse30 256) 0)) (.cse0 (not .cse4)) (.cse1 (not .cse3))) (let ((.cse35 (ite (or (and .cse0 .cse1) .cse42) 0 v_~y$w_buff1_used~0_582)) (.cse33 (not .cse31))) (let ((.cse39 (and .cse41 .cse33)) (.cse40 (= (mod .cse35 256) 0))) (let ((.cse24 (ite (or .cse39 (and .cse0 (not .cse40))) 0 v_~y$r_buff1_thd0~0_290))) (let ((.cse26 (= (mod .cse24 256) 0)) (.cse20 (= (mod v_~weak$$choice2~0_216 256) 0))) (let ((.cse19 (not .cse20)) (.cse36 (and .cse31 .cse40)) (.cse32 (and .cse31 .cse26))) (let ((.cse11 (ite .cse19 .cse37 (ite (or .cse36 .cse38 .cse32) .cse37 (ite .cse39 0 .cse37))))) (let ((.cse18 (= (mod .cse11 256) 0))) (let ((.cse22 (ite .cse19 .cse35 (ite (or .cse36 .cse18 .cse32) .cse35 0))) (.cse17 (= (mod v_~y$r_buff0_thd3~0_128 256) 0))) (let ((.cse13 (= (mod v_~y$r_buff1_thd3~0_120 256) 0)) (.cse34 (not (= (mod v_~y$w_buff0_used~0_604 256) 0))) (.cse10 (not .cse17)) (.cse14 (= (mod .cse22 256) 0))) (let ((.cse16 (not .cse14)) (.cse21 (and .cse34 .cse10)) (.cse23 (select |v_#memory_int_778| |v_~#y~0.base_374|)) (.cse9 (not .cse18)) (.cse15 (not .cse13))) (and (= |v_P3Thread1of1ForFork2_#in~arg.base_41| v_P3Thread1of1ForFork2_~arg.base_41) (= v_P3Thread1of1ForFork2_~arg.offset_41 |v_P3Thread1of1ForFork2_#in~arg.offset_41|) (= |v_P2Thread1of1ForFork0_#in~arg.base_55| v_P2Thread1of1ForFork0_~arg.base_55) (= v_~y$flush_delayed~0_204 0) (= v_~main$tmp_guard0~0_120 (ite (= (ite (= v_~__unbuffered_cnt~0_827 4) 1 0) 0) 0 1)) (= v_~main$tmp_guard1~0_92 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_125 1) (= v_~__unbuffered_p0_EBX~0_116 0) (= v_~y$mem_tmp~0_170 2) (= 2 v_~__unbuffered_p0_EAX~0_236))) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_407 v_~y$w_buff1~0_406) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_71|) (= v_~y$w_buff0~0_398 v_~y$w_buff0~0_397) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem33#1_208| |v_ULTIMATE.start_main_#t~mem33#1_210|))) (or (and (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~ite34#1_201|) (or (and .cse0 .cse1 (= v_~y$w_buff1~0_407 |v_ULTIMATE.start_main_#t~ite34#1_201|) .cse2) (and (or .cse3 .cse4) (= 2 |v_ULTIMATE.start_main_#t~mem33#1_208|))) (or .cse5 .cse6)) (and .cse7 (= v_~y$mem_tmp~0_170 v_~y$w_buff0~0_398) .cse8 .cse2 (= |v_ULTIMATE.start_main_#t~ite34#1_203| |v_ULTIMATE.start_main_#t~ite34#1_201|)))) (= v_~weak$$choice2~0_216 |v_ULTIMATE.start_main_#t~nondet37#1_167|) (= (ite (and .cse9 .cse10) 0 .cse11) v_~y$w_buff0_used~0_604) (let ((.cse12 (= |v_P2Thread1of1ForFork0_#t~mem19_78| |v_P2_#t~mem19_77|))) (or (and (= |v_P2_#t~ite21_74| v_~y$w_buff0~0_397) .cse9 .cse12 .cse10 (= |v_P2_#t~ite20_74| |v_P2Thread1of1ForFork0_#t~ite20_78|)) (and (= |v_P2_#t~ite20_74| |v_P2_#t~ite21_74|) (or (and (or .cse13 .cse14) (= |v_P2_#t~ite20_74| |v_P2_#t~mem19_77|) (= |v_ULTIMATE.start_main_#t~ite47#1_191| |v_P2_#t~mem19_77|)) (and .cse15 (= v_~y$w_buff1~0_406 |v_P2_#t~ite20_74|) .cse12 .cse16)) (or .cse17 .cse18)))) (= |v_P2Thread1of1ForFork0_#in~arg.offset_55| v_P2Thread1of1ForFork0_~arg.offset_55) (= v_~weak$$choice1~0_200 |v_ULTIMATE.start_main_#t~nondet41#1_159|) (or (and (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~ite47#1_191|) .cse19 (= |v_ULTIMATE.start_main_#t~mem46#1_253| |v_ULTIMATE.start_main_#t~mem46#1_251|)) (and .cse20 (= |v_ULTIMATE.start_main_#t~ite47#1_191| |v_ULTIMATE.start_main_#t~mem46#1_251|) (= v_~y$mem_tmp~0_170 |v_ULTIMATE.start_main_#t~mem46#1_251|))) (= v_~__unbuffered_p2_EAX~0_125 v_~x~0_124) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|) (= v_~y$w_buff1_used~0_580 (ite (or (and .cse15 .cse16) .cse21) 0 .cse22)) (= (store |v_#memory_int_778| |v_~#y~0.base_374| (store .cse23 |v_~#y~0.offset_372| |v_P2_#t~ite21_74|)) |v_#memory_int_776|) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_71| 0) (= v_~y$r_buff0_thd3~0_127 (ite .cse21 0 v_~y$r_buff0_thd3~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101| (mod v_~main$tmp_guard0~0_120 256)) (= v_~y$r_buff1_thd0~0_289 (ite .cse19 .cse24 (ite (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_294 256) 0))) (or (and .cse25 .cse14) .cse18 (and .cse26 .cse25))) .cse24 0))) (let ((.cse29 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_152 256) 0)) (.cse28 (= |v_ULTIMATE.start_main_#t~mem42#1_259| |v_ULTIMATE.start_main_#t~mem42#1_257|))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_254| v_~__unbuffered_p0_EAX~0_236) (let ((.cse27 (= (mod v_~weak$$choice1~0_200 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_257| |v_ULTIMATE.start_main_#t~ite43#1_254|) (not .cse27) (= |v_ULTIMATE.start_main_#t~mem42#1_257| (select (select (store |v_#memory_int_778| |v_~#y~0.base_374| (store .cse23 |v_~#y~0.offset_372| v_~y$mem_tmp~0_170)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149))) (and (= |v_ULTIMATE.start_main_#t~ite43#1_254| v_~__unbuffered_p0_EAX~0_237) .cse27 .cse28))) (not .cse29)) (and (= |v_ULTIMATE.start_main_#t~ite43#1_256| |v_ULTIMATE.start_main_#t~ite43#1_254|) .cse29 (= v_~__unbuffered_p0_EAX~0_237 v_~__unbuffered_p0_EAX~0_236) .cse28))) (= v_~y$r_buff0_thd0~0_294 (ite .cse19 .cse30 (ite (or (and .cse31 .cse14) .cse18 .cse32) .cse30 (ite (and .cse9 .cse33) 0 .cse30)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_127 256) 0)) .cse34) (and (not (= (mod v_~y$w_buff1_used~0_580 256) 0)) .cse15)) 0 v_~y$r_buff1_thd3~0_120) v_~y$r_buff1_thd3~0_119) (= |v_ULTIMATE.start_main_#t~nondet36#1_167| v_~weak$$choice0~0_214)))))))))))))))))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_78|, ~#y~0.offset=|v_~#y~0.offset_372|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_606, ~#y~0.base=|v_~#y~0.base_374|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_78|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_237, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_120, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_128, ~y$w_buff0~0=v_~y$w_buff0~0_398, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_41|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_152, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_55|, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_203|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_167|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_41|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_159|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_210|, ~y$w_buff1~0=v_~y$w_buff1~0_407, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_256|, ULTIMATE.start_main_#t~mem46#1=|v_ULTIMATE.start_main_#t~mem46#1_253|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_295, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_259|, #memory_int=|v_#memory_int_778|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_167|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_827, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_290, ~x~0=v_~x~0_124, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_55|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_582} OutVars{ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_129|, ~y$mem_tmp~0=v_~y$mem_tmp~0_170, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_236, ~weak$$choice1~0=v_~weak$$choice1~0_200, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_119, ~y$flush_delayed~0=v_~y$flush_delayed~0_204, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_110|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_41|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_125, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_55|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_41|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_101|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_150|, ~weak$$choice0~0=v_~weak$$choice0~0_214, ~y$w_buff1~0=v_~y$w_buff1~0_406, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_123|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_827, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_124, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_55|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_71|, ~#y~0.offset=|v_~#y~0.offset_372|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_604, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_41, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~#y~0.base=|v_~#y~0.base_374|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_41, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_55, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_41|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_127, ~y$w_buff0~0=v_~y$w_buff0~0_397, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_152, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_210|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_165|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_97|, ULTIMATE.start_main_#t~ite47#1=|v_ULTIMATE.start_main_#t~ite47#1_190|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_55, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_120, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_149, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_294, #memory_int=|v_#memory_int_776|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_149, ~weak$$choice2~0=v_~weak$$choice2~0_216, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_580, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_101|} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_201|, |v_ULTIMATE.start_main_#t~mem33#1_208|, |v_P2_#t~ite20_74|, |v_ULTIMATE.start_main_#t~mem42#1_257|, |v_P2_#t~ite21_74|, |v_ULTIMATE.start_main_#t~ite43#1_254|, |v_P2_#t~mem19_77|, |v_ULTIMATE.start_main_#t~mem46#1_251|, |v_ULTIMATE.start_main_#t~ite47#1_191|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ~main$tmp_guard1~0, P2Thread1of1ForFork0_#t~ite20, P3Thread1of1ForFork2_~arg.base, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~ite47#1, P2Thread1of1ForFork0_~arg.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ~y$w_buff1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite43#1, ULTIMATE.start_main_#t~mem46#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_#t~nondet32#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [702] L829-->L837: Formula: (let ((.cse9 (= (mod v_~y$r_buff0_thd4~0_32 256) 0))) (let ((.cse8 (= (mod v_~y$r_buff1_thd4~0_30 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_174 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~y$w_buff0_used~0_200 256) 0))) (.cse10 (= (mod v_~y$w_buff0_used~0_201 256) 0))) (let ((.cse2 (select |v_#memory_int_201| |v_~#y~0.base_144|)) (.cse1 (not .cse10)) (.cse3 (and .cse0 .cse11)) (.cse6 (not .cse7)) (.cse4 (not .cse8))) (and (= v_~y$w_buff0_used~0_200 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_201)) (= (store |v_#memory_int_201| |v_~#y~0.base_144| (store .cse2 |v_~#y~0.offset_144| |v_P3_#t~ite24_29|)) |v_#memory_int_200|) (= (ite .cse3 0 v_~y$r_buff0_thd4~0_32) v_~y$r_buff0_thd4~0_31) (let ((.cse5 (= |v_P3_#t~mem22_32| |v_P3Thread1of1ForFork2_#t~mem22_1|))) (or (and (or (and .cse4 (= |v_P3_#t~ite23_27| v_~y$w_buff1~0_86) .cse5 .cse6) (and (or .cse7 .cse8) (= |v_P3_#t~ite23_27| |v_P3_#t~mem22_32|) (= (select .cse2 |v_~#y~0.offset_144|) |v_P3_#t~mem22_32|))) (or .cse9 .cse10) (= |v_P3_#t~ite23_27| |v_P3_#t~ite24_29|)) (and (= |v_P3_#t~ite24_29| v_~y$w_buff0~0_84) .cse0 (= |v_P3Thread1of1ForFork2_#t~ite23_1| |v_P3_#t~ite23_27|) .cse5 .cse1))) (= v_~y$w_buff1_used~0_173 (ite (or .cse3 (and .cse4 .cse6)) 0 v_~y$w_buff1_used~0_174)) (= (ite (or (and .cse11 (not (= (mod v_~y$r_buff0_thd4~0_31 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_173 256) 0)))) 0 v_~y$r_buff1_thd4~0_30) v_~y$r_buff1_thd4~0_29))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_30, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_201|, P3Thread1of1ForFork2_#t~ite23=|v_P3Thread1of1ForFork2_#t~ite23_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174, P3Thread1of1ForFork2_#t~mem22=|v_P3Thread1of1ForFork2_#t~mem22_1|} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_31, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_29, ~#y~0.offset=|v_~#y~0.offset_144|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_200, ~y$w_buff1~0=v_~y$w_buff1~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_84, #memory_int=|v_#memory_int_200|, P3Thread1of1ForFork2_#t~ite24=|v_P3Thread1of1ForFork2_#t~ite24_1|, ~#y~0.base=|v_~#y~0.base_144|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} AuxVars[|v_P3_#t~ite24_29|, |v_P3_#t~ite23_27|, |v_P3_#t~mem22_32|] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, #memory_int, P3Thread1of1ForFork2_#t~ite24, P3Thread1of1ForFork2_#t~ite23, ~y$w_buff1_used~0, P3Thread1of1ForFork2_#t~mem22] [2022-12-13 12:05:04,151 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 12:05:04,154 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46059 [2022-12-13 12:05:04,154 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 821 flow [2022-12-13 12:05:04,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:05:04,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:04,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:04,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:05:04,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:05:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:04,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1427703982, now seen corresponding path program 1 times [2022-12-13 12:05:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983103640] [2022-12-13 12:05:04,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:04,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:05:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:05:04,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:05:04,343 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:05:04,344 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 12:05:04,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 12:05:04,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 12:05:04,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 12:05:04,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 12:05:04,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:05:04,347 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:04,351 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:05:04,351 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:05:04,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:05:04 BasicIcfg [2022-12-13 12:05:04,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:05:04,445 INFO L158 Benchmark]: Toolchain (without parser) took 91232.41ms. Allocated memory was 192.9MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 167.2MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 12:05:04,445 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:05:04,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.13ms. Allocated memory is still 192.9MB. Free memory was 167.0MB in the beginning and 138.1MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 12:05:04,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.75ms. Allocated memory is still 192.9MB. Free memory was 138.1MB in the beginning and 135.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:05:04,446 INFO L158 Benchmark]: Boogie Preprocessor took 25.51ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:05:04,446 INFO L158 Benchmark]: RCFGBuilder took 957.84ms. Allocated memory is still 192.9MB. Free memory was 132.9MB in the beginning and 120.9MB in the end (delta: 12.0MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2022-12-13 12:05:04,446 INFO L158 Benchmark]: TraceAbstraction took 89718.30ms. Allocated memory was 192.9MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 119.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-13 12:05:04,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.13ms. Allocated memory is still 192.9MB. Free memory was 167.0MB in the beginning and 138.1MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.75ms. Allocated memory is still 192.9MB. Free memory was 138.1MB in the beginning and 135.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.51ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 132.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 957.84ms. Allocated memory is still 192.9MB. Free memory was 132.9MB in the beginning and 120.9MB in the end (delta: 12.0MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. * TraceAbstraction took 89718.30ms. Allocated memory was 192.9MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 119.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 137 PlacesBefore, 48 PlacesAfterwards, 125 TransitionsBefore, 36 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1773, independent: 1660, independent conditional: 1660, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1773, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1773, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1773, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1231, independent: 1187, independent conditional: 0, independent unconditional: 1187, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1231, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 414, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1773, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1231, unknown conditional: 0, unknown unconditional: 1231] , Statistics on independence cache: Total cache size (in pairs): 1743, Positive cache size: 1699, Positive conditional cache size: 0, Positive unconditional cache size: 1699, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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.3s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277, independent: 241, independent conditional: 241, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 277, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 277, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 277, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 89, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 276, dependent conditional: 0, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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, 47 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 250, independent: 216, independent conditional: 12, independent unconditional: 204, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, 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: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, independent: 212, independent conditional: 212, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 245, independent: 212, independent conditional: 9, independent unconditional: 203, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 245, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 245, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 245, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 202, independent conditional: 202, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 202, independent conditional: 15, independent unconditional: 187, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 28, dependent conditional: 2, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 716 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 519, independent: 465, independent conditional: 465, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 519, independent: 465, independent conditional: 37, independent unconditional: 428, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 519, independent: 465, independent conditional: 0, independent unconditional: 465, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 519, independent: 465, independent conditional: 0, independent unconditional: 465, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 519, independent: 449, independent conditional: 0, independent unconditional: 449, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 245, Positive conditional cache size: 0, Positive unconditional cache size: 245, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 898 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321, independent: 295, independent conditional: 295, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321, independent: 295, independent conditional: 85, independent unconditional: 210, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 321, independent: 295, independent conditional: 55, independent unconditional: 240, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 321, independent: 295, independent conditional: 55, independent unconditional: 240, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 321, independent: 283, independent conditional: 49, independent unconditional: 234, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 267, Positive conditional cache size: 6, Positive unconditional cache size: 261, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 978 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 148, independent: 135, independent conditional: 32, independent unconditional: 103, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 135, independent conditional: 26, independent unconditional: 109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 135, independent conditional: 26, independent unconditional: 109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, 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: 148, independent: 135, independent conditional: 26, independent unconditional: 109, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 267, Positive conditional cache size: 6, Positive unconditional cache size: 261, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 63 PlacesBefore, 62 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 964 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 390, independent: 358, independent conditional: 358, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 390, independent: 358, independent conditional: 164, independent unconditional: 194, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 390, independent: 358, independent conditional: 152, independent unconditional: 206, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 390, independent: 358, independent conditional: 152, independent unconditional: 206, dependent: 32, dependent conditional: 6, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 390, independent: 346, independent conditional: 140, independent unconditional: 206, dependent: 31, dependent conditional: 5, dependent unconditional: 26, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 300, Positive conditional cache size: 18, Positive unconditional cache size: 282, Negative cache size: 37, Negative conditional cache size: 3, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 11, dependent conditional: 3, dependent unconditional: 8, 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: 43, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 300, Positive conditional cache size: 18, Positive unconditional cache size: 282, Negative cache size: 37, Negative conditional cache size: 3, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 67 PlacesBefore, 67 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 292, independent: 264, independent conditional: 264, 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: 292, independent: 264, independent conditional: 167, independent unconditional: 97, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 292, independent: 264, independent conditional: 166, independent unconditional: 98, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 292, independent: 264, independent conditional: 166, independent unconditional: 98, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 13, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 292, independent: 246, independent conditional: 153, independent unconditional: 93, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 18, unknown conditional: 13, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 319, Positive conditional cache size: 31, Positive unconditional cache size: 288, Negative cache size: 37, Negative conditional cache size: 3, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 70 PlacesBefore, 70 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 320, Positive conditional cache size: 32, Positive unconditional cache size: 288, Negative cache size: 37, Negative conditional cache size: 3, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 123, independent conditional: 111, independent unconditional: 12, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 129, independent: 123, independent conditional: 109, independent unconditional: 14, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 123, independent conditional: 109, independent unconditional: 14, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 28, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 129, independent: 91, independent conditional: 81, independent unconditional: 10, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 32, unknown conditional: 28, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 352, Positive conditional cache size: 60, Positive unconditional cache size: 292, Negative cache size: 37, Negative conditional cache size: 3, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.0s, 71 PlacesBefore, 72 PlacesAfterwards, 73 TransitionsBefore, 77 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 336, independent: 336, independent conditional: 336, 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: 336, independent: 336, independent conditional: 336, 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: 336, independent: 336, independent conditional: 336, 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: 336, independent: 336, independent conditional: 336, 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: 89, independent: 89, independent conditional: 89, 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: 89, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 89, unknown conditional: 89, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 573, Positive conditional cache size: 154, Positive unconditional cache size: 419, Negative cache size: 37, Negative conditional cache size: 3, 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: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=9, t2225={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=10, t2225={7:0}, t2226={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2227; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 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_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 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_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 [L785] 1 __unbuffered_p0_EBX = x [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=11, t2225={7:0}, t2226={5:0}, t2227={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 pthread_t t2228; [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=12, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = x [L812] 3 y = 1 [L815] 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) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] 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) [L815] 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) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 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 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 4 y = 2 [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] 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) [L867] 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) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 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 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 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 [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 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: 857]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 89.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1206 IncrementalHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 4 mSDtfsCounter, 1206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821occurred in iteration=13, InterpolantAutomatonStates: 52, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:05:04,496 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...