/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:48:48,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:48:48,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:48:48,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:48:48,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:48:48,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:48:48,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:48:48,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:48:48,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:48:48,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:48:48,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:48:48,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:48:48,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:48:48,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:48:48,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:48:48,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:48:48,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:48:48,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:48:48,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:48:48,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:48:48,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:48:48,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:48:48,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:48:48,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:48:48,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:48:48,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:48:48,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:48:48,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:48:48,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:48:48,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:48:48,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:48:48,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:48:48,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:48:48,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:48:48,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:48:48,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:48:48,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:48:48,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:48:48,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:48:48,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:48:48,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:48:48,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:48:48,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:48:48,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:48:48,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:48:48,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:48:48,835 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:48:48,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:48:48,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:48:48,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:48:48,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:48:48,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:48:48,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:48:48,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:48:48,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:48:48,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:48:48,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:48:48,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:48:48,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:48:49,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:48:49,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:48:49,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:48:49,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:48:49,114 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:48:49,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-12-13 00:48:50,180 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:48:50,439 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:48:50,439 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-12-13 00:48:50,458 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5614507/58f30fe8ff0540d0940ad73ede506f1e/FLAGe456d3afd [2022-12-13 00:48:50,474 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5614507/58f30fe8ff0540d0940ad73ede506f1e [2022-12-13 00:48:50,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:48:50,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:48:50,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:48:50,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:48:50,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:48:50,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62222a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50, skipping insertion in model container [2022-12-13 00:48:50,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:48:50,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:48:50,618 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-12-13 00:48:50,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:48:50,780 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:48:50,789 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/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-12-13 00:48:50,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:50,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:50,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:48:50,849 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:48:50,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50 WrapperNode [2022-12-13 00:48:50,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:48:50,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:48:50,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:48:50,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:48:50,856 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:48:50" (1/1) ... [2022-12-13 00:48:50,887 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:48:50" (1/1) ... [2022-12-13 00:48:50,908 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 00:48:50,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:48:50,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:48:50,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:48:50,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:48:50,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,942 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:48:50,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:48:50,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:48:50,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:48:50,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (1/1) ... [2022-12-13 00:48:50,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:48:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:48:51,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:48:51,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:48:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:48:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:48:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:48:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:48:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:48:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:48:51,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:48:51,048 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:48:51,190 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:48:51,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:48:51,537 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:48:51,694 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:48:51,694 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:48:51,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:51 BoogieIcfgContainer [2022-12-13 00:48:51,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:48:51,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:48:51,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:48:51,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:48:51,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:48:50" (1/3) ... [2022-12-13 00:48:51,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56851458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:51, skipping insertion in model container [2022-12-13 00:48:51,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:50" (2/3) ... [2022-12-13 00:48:51,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56851458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:51, skipping insertion in model container [2022-12-13 00:48:51,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:51" (3/3) ... [2022-12-13 00:48:51,703 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2022-12-13 00:48:51,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:48:51,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:48:51,717 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:48:51,770 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:48:51,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:48:51,897 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 00:48:51,897 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:51,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-13 00:48:51,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 00:48:51,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:51,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:51,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:51,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:51,941 INFO L130 PetriNetUnfolder]: 1/110 cut-off events. [2022-12-13 00:48:51,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:51,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 1/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 00:48:51,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 110 transitions, 229 flow [2022-12-13 00:48:51,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-13 00:48:59,207 INFO L241 LiptonReduction]: Total number of compositions: 92 [2022-12-13 00:48:59,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:48:59,235 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;@41393fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:48:59,235 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:48:59,241 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 00:48:59,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:59,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:59,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:59,243 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 1 more)] === [2022-12-13 00:48:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1718979223, now seen corresponding path program 1 times [2022-12-13 00:48:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:59,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146559544] [2022-12-13 00:48:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:59,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146559544] [2022-12-13 00:48:59,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146559544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:59,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:59,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769474715] [2022-12-13 00:48:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:59,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:48:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:48:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:48:59,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 00:48:59,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:59,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:59,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 00:48:59,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:59,709 INFO L130 PetriNetUnfolder]: 711/1177 cut-off events. [2022-12-13 00:48:59,710 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 00:48:59,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1177 events. 711/1177 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6273 event pairs, 711 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 2285. Up to 1073 conditions per place. [2022-12-13 00:48:59,723 INFO L137 encePairwiseOnDemand]: 28/29 looper letters, 19 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2022-12-13 00:48:59,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 103 flow [2022-12-13 00:48:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:48:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:48:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-12-13 00:48:59,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 00:48:59,732 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 2 states and 38 transitions. [2022-12-13 00:48:59,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 103 flow [2022-12-13 00:48:59,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:59,735 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2022-12-13 00:48:59,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 00:48:59,740 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2022-12-13 00:48:59,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:59,740 INFO L89 Accepts]: Start accepts. Operand has 36 places, 28 transitions, 62 flow [2022-12-13 00:48:59,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:59,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:59,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 62 flow [2022-12-13 00:48:59,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 62 flow [2022-12-13 00:48:59,754 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:48:59,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:59,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:48:59,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 62 flow [2022-12-13 00:48:59,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 00:49:00,058 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:00,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-13 00:49:00,061 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 62 flow [2022-12-13 00:49:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:00,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:00,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:00,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:49:00,075 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 1 more)] === [2022-12-13 00:49:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1623359709, now seen corresponding path program 1 times [2022-12-13 00:49:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:00,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076320056] [2022-12-13 00:49:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:00,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:00,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076320056] [2022-12-13 00:49:00,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076320056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:00,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:00,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:49:00,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335923643] [2022-12-13 00:49:00,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:00,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:00,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:00,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 28 [2022-12-13 00:49:00,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:00,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:00,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 28 [2022-12-13 00:49:00,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:00,542 INFO L130 PetriNetUnfolder]: 671/1153 cut-off events. [2022-12-13 00:49:00,542 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:00,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 1153 events. 671/1153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6369 event pairs, 159 based on Foata normal form. 16/930 useless extension candidates. Maximal degree in co-relation 2205. Up to 817 conditions per place. [2022-12-13 00:49:00,546 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-13 00:49:00,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 132 flow [2022-12-13 00:49:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 00:49:00,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-13 00:49:00,548 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 62 flow. Second operand 3 states and 55 transitions. [2022-12-13 00:49:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 132 flow [2022-12-13 00:49:00,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:49:00,549 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 70 flow [2022-12-13 00:49:00,549 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 00:49:00,550 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2022-12-13 00:49:00,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:00,550 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 70 flow [2022-12-13 00:49:00,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:00,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:00,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 70 flow [2022-12-13 00:49:00,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 70 flow [2022-12-13 00:49:00,554 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:49:00,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:00,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 64 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:00,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 70 flow [2022-12-13 00:49:00,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-13 00:49:00,556 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:00,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 00:49:00,557 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 70 flow [2022-12-13 00:49:00,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:00,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:00,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:00,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:49:00,557 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 1 more)] === [2022-12-13 00:49:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1215455967, now seen corresponding path program 1 times [2022-12-13 00:49:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:00,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849434991] [2022-12-13 00:49:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:00,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:00,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:00,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849434991] [2022-12-13 00:49:00,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849434991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:00,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:00,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:00,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120999092] [2022-12-13 00:49:00,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:00,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2022-12-13 00:49:00,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:00,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:00,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2022-12-13 00:49:00,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:00,933 INFO L130 PetriNetUnfolder]: 1042/1772 cut-off events. [2022-12-13 00:49:00,934 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-13 00:49:00,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 1772 events. 1042/1772 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10425 event pairs, 269 based on Foata normal form. 80/1468 useless extension candidates. Maximal degree in co-relation 3567. Up to 609 conditions per place. [2022-12-13 00:49:00,940 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 31 selfloop transitions, 3 changer transitions 7/49 dead transitions. [2022-12-13 00:49:00,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 199 flow [2022-12-13 00:49:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 00:49:00,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2022-12-13 00:49:00,941 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 70 flow. Second operand 4 states and 75 transitions. [2022-12-13 00:49:00,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 199 flow [2022-12-13 00:49:00,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:00,943 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 80 flow [2022-12-13 00:49:00,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 00:49:00,944 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 00:49:00,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:00,944 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 80 flow [2022-12-13 00:49:00,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:00,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:00,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 80 flow [2022-12-13 00:49:00,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 80 flow [2022-12-13 00:49:00,948 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 00:49:00,949 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:49:00,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 28 events. 0/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:00,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 80 flow [2022-12-13 00:49:00,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-13 00:49:00,985 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:00,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 00:49:00,986 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 78 flow [2022-12-13 00:49:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:00,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:00,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:00,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:49:00,986 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 1 more)] === [2022-12-13 00:49:00,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash -430436842, now seen corresponding path program 1 times [2022-12-13 00:49:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:00,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293997371] [2022-12-13 00:49:00,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:00,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:01,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293997371] [2022-12-13 00:49:01,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293997371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:01,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:01,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601340767] [2022-12-13 00:49:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:01,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:01,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 00:49:01,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 78 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 00:49:01,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:01,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 00:49:01,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:01,279 INFO L130 PetriNetUnfolder]: 870/1512 cut-off events. [2022-12-13 00:49:01,279 INFO L131 PetriNetUnfolder]: For 627/627 co-relation queries the response was YES. [2022-12-13 00:49:01,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 1512 events. 870/1512 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8228 event pairs, 300 based on Foata normal form. 60/1216 useless extension candidates. Maximal degree in co-relation 3300. Up to 547 conditions per place. [2022-12-13 00:49:01,283 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 29 selfloop transitions, 3 changer transitions 14/52 dead transitions. [2022-12-13 00:49:01,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 236 flow [2022-12-13 00:49:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 00:49:01,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2022-12-13 00:49:01,285 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 78 flow. Second operand 4 states and 75 transitions. [2022-12-13 00:49:01,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 236 flow [2022-12-13 00:49:01,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 217 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:49:01,286 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 78 flow [2022-12-13 00:49:01,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2022-12-13 00:49:01,287 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 00:49:01,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:01,287 INFO L89 Accepts]: Start accepts. Operand has 41 places, 26 transitions, 78 flow [2022-12-13 00:49:01,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:01,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:01,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 78 flow [2022-12-13 00:49:01,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 26 transitions, 78 flow [2022-12-13 00:49:01,292 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 00:49:01,292 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:49:01,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 26 events. 0/26 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 51 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:01,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 78 flow [2022-12-13 00:49:01,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-13 00:49:02,448 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:02,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1162 [2022-12-13 00:49:02,449 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 76 flow [2022-12-13 00:49:02,449 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 00:49:02,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:02,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:02,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:49:02,450 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 1 more)] === [2022-12-13 00:49:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -791834096, now seen corresponding path program 1 times [2022-12-13 00:49:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:02,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511746126] [2022-12-13 00:49:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:03,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:03,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511746126] [2022-12-13 00:49:03,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511746126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:03,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:03,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:49:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682229457] [2022-12-13 00:49:03,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:03,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:49:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:49:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:49:03,196 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2022-12-13 00:49:03,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:03,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:03,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2022-12-13 00:49:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:03,329 INFO L130 PetriNetUnfolder]: 429/725 cut-off events. [2022-12-13 00:49:03,330 INFO L131 PetriNetUnfolder]: For 290/290 co-relation queries the response was YES. [2022-12-13 00:49:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 725 events. 429/725 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 93 based on Foata normal form. 9/547 useless extension candidates. Maximal degree in co-relation 1623. Up to 436 conditions per place. [2022-12-13 00:49:03,333 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 29 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-13 00:49:03,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 168 flow [2022-12-13 00:49:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 00:49:03,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-13 00:49:03,335 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 76 flow. Second operand 4 states and 53 transitions. [2022-12-13 00:49:03,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 168 flow [2022-12-13 00:49:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 156 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:49:03,336 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 74 flow [2022-12-13 00:49:03,336 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-13 00:49:03,337 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-13 00:49:03,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:03,337 INFO L89 Accepts]: Start accepts. Operand has 39 places, 25 transitions, 74 flow [2022-12-13 00:49:03,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:03,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:03,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 74 flow [2022-12-13 00:49:03,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 74 flow [2022-12-13 00:49:03,342 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 00:49:03,342 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:49:03,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 25 events. 0/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 46 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:49:03,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 74 flow [2022-12-13 00:49:03,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 00:49:03,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:03,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 00:49:03,411 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 72 flow [2022-12-13 00:49:03,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:03,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:03,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:03,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:49:03,411 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 1 more)] === [2022-12-13 00:49:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash 178615913, now seen corresponding path program 1 times [2022-12-13 00:49:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:03,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377542213] [2022-12-13 00:49:03,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:03,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:03,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:03,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377542213] [2022-12-13 00:49:03,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377542213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:03,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:03,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:49:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300765895] [2022-12-13 00:49:03,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:03,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:03,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:03,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:03,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:03,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 00:49:03,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:03,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:03,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 00:49:03,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:03,742 INFO L130 PetriNetUnfolder]: 916/1446 cut-off events. [2022-12-13 00:49:03,742 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-13 00:49:03,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1446 events. 916/1446 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6971 event pairs, 64 based on Foata normal form. 101/917 useless extension candidates. Maximal degree in co-relation 3311. Up to 847 conditions per place. [2022-12-13 00:49:03,747 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 39 selfloop transitions, 11 changer transitions 1/53 dead transitions. [2022-12-13 00:49:03,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 250 flow [2022-12-13 00:49:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:49:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:49:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 00:49:03,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2022-12-13 00:49:03,749 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 72 flow. Second operand 4 states and 61 transitions. [2022-12-13 00:49:03,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 250 flow [2022-12-13 00:49:03,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 234 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 00:49:03,752 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 144 flow [2022-12-13 00:49:03,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-13 00:49:03,754 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-13 00:49:03,754 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:03,754 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 144 flow [2022-12-13 00:49:03,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:03,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:03,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 144 flow [2022-12-13 00:49:03,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 144 flow [2022-12-13 00:49:03,784 INFO L130 PetriNetUnfolder]: 216/417 cut-off events. [2022-12-13 00:49:03,784 INFO L131 PetriNetUnfolder]: For 48/57 co-relation queries the response was YES. [2022-12-13 00:49:03,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 417 events. 216/417 cut-off events. For 48/57 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 2312 event pairs, 108 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 908. Up to 343 conditions per place. [2022-12-13 00:49:03,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 144 flow [2022-12-13 00:49:03,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 00:49:06,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:06,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3121 [2022-12-13 00:49:06,875 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 147 flow [2022-12-13 00:49:06,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:06,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:06,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:06,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:49:06,876 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 1 more)] === [2022-12-13 00:49:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 640067445, now seen corresponding path program 1 times [2022-12-13 00:49:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:06,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349242429] [2022-12-13 00:49:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:06,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:07,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349242429] [2022-12-13 00:49:07,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349242429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:07,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:07,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:49:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225715574] [2022-12-13 00:49:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:07,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:49:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:07,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:49:07,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:49:07,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 00:49:07,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:07,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:07,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 00:49:07,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:07,206 INFO L130 PetriNetUnfolder]: 609/1071 cut-off events. [2022-12-13 00:49:07,206 INFO L131 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2022-12-13 00:49:07,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1071 events. 609/1071 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5566 event pairs, 21 based on Foata normal form. 96/731 useless extension candidates. Maximal degree in co-relation 3355. Up to 727 conditions per place. [2022-12-13 00:49:07,210 INFO L137 encePairwiseOnDemand]: 12/27 looper letters, 42 selfloop transitions, 20 changer transitions 1/65 dead transitions. [2022-12-13 00:49:07,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 65 transitions, 390 flow [2022-12-13 00:49:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:49:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:49:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-13 00:49:07,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 00:49:07,213 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 147 flow. Second operand 5 states and 75 transitions. [2022-12-13 00:49:07,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 65 transitions, 390 flow [2022-12-13 00:49:07,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:49:07,216 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 259 flow [2022-12-13 00:49:07,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2022-12-13 00:49:07,216 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-13 00:49:07,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:07,216 INFO L89 Accepts]: Start accepts. Operand has 43 places, 42 transitions, 259 flow [2022-12-13 00:49:07,217 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:07,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:07,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 42 transitions, 259 flow [2022-12-13 00:49:07,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 259 flow [2022-12-13 00:49:07,245 INFO L130 PetriNetUnfolder]: 162/381 cut-off events. [2022-12-13 00:49:07,245 INFO L131 PetriNetUnfolder]: For 135/189 co-relation queries the response was YES. [2022-12-13 00:49:07,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 381 events. 162/381 cut-off events. For 135/189 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 2225 event pairs, 27 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 1178. Up to 280 conditions per place. [2022-12-13 00:49:07,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 42 transitions, 259 flow [2022-12-13 00:49:07,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-13 00:49:07,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:49:07,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 00:49:07,345 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 265 flow [2022-12-13 00:49:07,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:07,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:07,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:49:07,345 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 1 more)] === [2022-12-13 00:49:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash 260871828, now seen corresponding path program 1 times [2022-12-13 00:49:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:07,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480626120] [2022-12-13 00:49:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:49:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:07,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480626120] [2022-12-13 00:49:07,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480626120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:07,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:07,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:49:07,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952349591] [2022-12-13 00:49:07,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:07,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:49:07,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:07,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:49:07,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:49:07,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-13 00:49:07,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:07,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:07,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-13 00:49:07,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:07,651 INFO L130 PetriNetUnfolder]: 255/567 cut-off events. [2022-12-13 00:49:07,651 INFO L131 PetriNetUnfolder]: For 514/514 co-relation queries the response was YES. [2022-12-13 00:49:07,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 567 events. 255/567 cut-off events. For 514/514 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3082 event pairs, 6 based on Foata normal form. 72/429 useless extension candidates. Maximal degree in co-relation 2278. Up to 343 conditions per place. [2022-12-13 00:49:07,654 INFO L137 encePairwiseOnDemand]: 12/30 looper letters, 22 selfloop transitions, 29 changer transitions 1/54 dead transitions. [2022-12-13 00:49:07,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 409 flow [2022-12-13 00:49:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:49:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:49:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 00:49:07,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 00:49:07,655 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 265 flow. Second operand 6 states and 66 transitions. [2022-12-13 00:49:07,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 409 flow [2022-12-13 00:49:07,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 358 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 00:49:07,659 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 309 flow [2022-12-13 00:49:07,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 00:49:07,660 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-13 00:49:07,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:07,660 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 309 flow [2022-12-13 00:49:07,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:07,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:07,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 309 flow [2022-12-13 00:49:07,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 309 flow [2022-12-13 00:49:07,679 INFO L130 PetriNetUnfolder]: 81/252 cut-off events. [2022-12-13 00:49:07,679 INFO L131 PetriNetUnfolder]: For 292/313 co-relation queries the response was YES. [2022-12-13 00:49:07,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 252 events. 81/252 cut-off events. For 292/313 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1369 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 940. Up to 163 conditions per place. [2022-12-13 00:49:07,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 309 flow [2022-12-13 00:49:07,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 00:49:07,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] L798-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 00:49:07,706 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L798-->L803: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 00:49:07,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L798-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [619] L842-3-->L845: Formula: (= v_~main$tmp_guard0~0_26 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1] [2022-12-13 00:49:12,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L783-->L788: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:12,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [609] L783-->P0FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:13,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [610] L783-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:14,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [628] L798-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:15,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [677] L812-->L823: Formula: (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_136 256) 0))) (let ((.cse1 (= (mod v_~z$w_buff0_used~0_392 256) 0)) (.cse6 (= (mod v_~z$r_buff1_thd3~0_132 256) 0)) (.cse11 (not (= (mod v_~z$w_buff0_used~0_391 256) 0))) (.cse9 (not .cse2)) (.cse7 (= (mod v_~z$w_buff1_used~0_382 256) 0))) (let ((.cse0 (select |v_#memory_int_492| |v_~#z~0.base_243|)) (.cse4 (not .cse7)) (.cse10 (and .cse11 .cse9)) (.cse3 (not .cse6)) (.cse8 (not .cse1))) (and (= v_~__unbuffered_cnt~0_567 (+ v_~__unbuffered_cnt~0_568 1)) (= |v_#memory_int_491| (store |v_#memory_int_492| |v_~#z~0.base_243| (store .cse0 |v_~#z~0.offset_243| |v_P2_#t~ite21_67|))) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem19_86| |v_P2_#t~mem19_76|))) (or (and (= |v_P2_#t~ite20_71| |v_P2_#t~ite21_67|) (or .cse1 .cse2) (or (and .cse3 .cse4 .cse5 (= |v_P2_#t~ite20_71| v_~z$w_buff1~0_248)) (and (= |v_P2_#t~mem19_76| (select .cse0 |v_~#z~0.offset_243|)) (= |v_P2_#t~ite20_71| |v_P2_#t~mem19_76|) (or .cse6 .cse7)))) (and (= |v_P2_#t~ite20_71| |v_P2Thread1of1ForFork0_#t~ite20_86|) .cse8 .cse9 (= |v_P2_#t~ite21_67| v_~z$w_buff0~0_238) .cse5))) (= v_~z$r_buff0_thd3~0_135 (ite .cse10 0 v_~z$r_buff0_thd3~0_136)) (= (ite (or (and .cse3 .cse4) .cse10) 0 v_~z$w_buff1_used~0_382) v_~z$w_buff1_used~0_381) (= v_~z$r_buff1_thd3~0_131 (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_135 256) 0)) .cse11) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_381 256) 0)))) 0 v_~z$r_buff1_thd3~0_132)) (= (ite (and .cse8 .cse9) 0 v_~z$w_buff0_used~0_392) v_~z$w_buff0_used~0_391))))) InVars {~#z~0.base=|v_~#z~0.base_243|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_86|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_392, ~z$w_buff0~0=v_~z$w_buff0~0_238, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_382, #memory_int=|v_#memory_int_492|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_136, ~z$w_buff1~0=v_~z$w_buff1~0_248, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_568, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_86|, ~#z~0.offset=|v_~#z~0.offset_243|} OutVars{~#z~0.base=|v_~#z~0.base_243|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_391, ~z$w_buff0~0=v_~z$w_buff0~0_238, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ~z$w_buff1~0=v_~z$w_buff1~0_248, ~#z~0.offset=|v_~#z~0.offset_243|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_45|, #memory_int=|v_#memory_int_491|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_135, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_567} AuxVars[|v_P2_#t~ite20_71|, |v_P2_#t~ite21_67|, |v_P2_#t~mem19_76|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#t~ite21, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:17,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [543] L798-->L803: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:17,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L798-->P1FINAL: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:18,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [669] L812-->P2FINAL: Formula: (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_104 256) 0))) (let ((.cse9 (= (mod v_~z$r_buff1_thd3~0_100 256) 0)) (.cse0 (not .cse8)) (.cse11 (not (= (mod v_~z$w_buff0_used~0_359 256) 0))) (.cse10 (= (mod v_~z$w_buff1_used~0_350 256) 0)) (.cse7 (= (mod v_~z$w_buff0_used~0_360 256) 0))) (let ((.cse1 (not .cse7)) (.cse3 (not .cse10)) (.cse5 (select |v_#memory_int_460| |v_~#z~0.base_227|)) (.cse2 (and .cse0 .cse11)) (.cse4 (not .cse9))) (and (= v_~__unbuffered_cnt~0_535 (+ v_~__unbuffered_cnt~0_536 1)) (= v_~z$w_buff0_used~0_359 (ite (and .cse0 .cse1) 0 v_~z$w_buff0_used~0_360)) (= |v_P2Thread1of1ForFork0_#res.offset_49| 0) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~z$w_buff1_used~0_350) v_~z$w_buff1_used~0_349) (= (store |v_#memory_int_460| |v_~#z~0.base_227| (store .cse5 |v_~#z~0.offset_227| |v_P2_#t~ite21_51|)) |v_#memory_int_459|) (let ((.cse6 (= |v_P2Thread1of1ForFork0_#t~mem19_54| |v_P2_#t~mem19_60|))) (or (and (= |v_P2_#t~ite21_51| v_~z$w_buff0~0_222) (= |v_P2_#t~ite20_55| |v_P2Thread1of1ForFork0_#t~ite20_54|) .cse0 .cse1 .cse6) (and (or .cse7 .cse8) (= |v_P2_#t~ite20_55| |v_P2_#t~ite21_51|) (or (and (= |v_P2_#t~ite20_55| v_~z$w_buff1~0_232) .cse3 .cse4 .cse6) (and (or .cse9 .cse10) (= |v_P2_#t~ite20_55| |v_P2_#t~mem19_60|) (= (select .cse5 |v_~#z~0.offset_227|) |v_P2_#t~mem19_60|)))))) (= v_~z$r_buff0_thd3~0_103 (ite .cse2 0 v_~z$r_buff0_thd3~0_104)) (= |v_P2Thread1of1ForFork0_#res.base_49| 0) (= v_~z$r_buff1_thd3~0_99 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_349 256) 0)) .cse4) (and .cse11 (not (= (mod v_~z$r_buff0_thd3~0_103 256) 0)))) 0 v_~z$r_buff1_thd3~0_100)))))) InVars {~#z~0.base=|v_~#z~0.base_227|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_54|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_360, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_100, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_350, #memory_int=|v_#memory_int_460|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_104, ~z$w_buff1~0=v_~z$w_buff1~0_232, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_536, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_54|, ~#z~0.offset=|v_~#z~0.offset_227|} OutVars{~#z~0.base=|v_~#z~0.base_227|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_49|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_359, ~z$w_buff0~0=v_~z$w_buff0~0_222, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_99, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_349, ~z$w_buff1~0=v_~z$w_buff1~0_232, ~#z~0.offset=|v_~#z~0.offset_227|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_29|, #memory_int=|v_#memory_int_459|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_103, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_535, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_49|} AuxVars[|v_P2_#t~ite21_51|, |v_P2_#t~mem19_60|, |v_P2_#t~ite20_55|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite21, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:20,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [670] L812-->P2EXIT: Formula: (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_108 256) 0))) (let ((.cse10 (= (mod v_~z$r_buff1_thd3~0_104 256) 0)) (.cse11 (= (mod v_~z$w_buff1_used~0_354 256) 0)) (.cse9 (= (mod v_~z$w_buff0_used~0_364 256) 0)) (.cse1 (not (= (mod v_~z$w_buff0_used~0_363 256) 0))) (.cse5 (not .cse8))) (let ((.cse0 (and .cse1 .cse5)) (.cse4 (not .cse9)) (.cse6 (not .cse11)) (.cse2 (not .cse10)) (.cse3 (select |v_#memory_int_464| |v_~#z~0.base_229|))) (and (= (ite .cse0 0 v_~z$r_buff0_thd3~0_108) v_~z$r_buff0_thd3~0_107) (= v_~__unbuffered_cnt~0_539 (+ v_~__unbuffered_cnt~0_540 1)) (= v_~z$r_buff1_thd3~0_103 (ite (or (and .cse1 (not (= (mod v_~z$r_buff0_thd3~0_107 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_353 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_104)) (= |v_P2Thread1of1ForFork0_#res.base_51| 0) (= |v_P2Thread1of1ForFork0_#res.offset_51| 0) (= (store |v_#memory_int_464| |v_~#z~0.base_229| (store .cse3 |v_~#z~0.offset_229| |v_P2_#t~ite21_53|)) |v_#memory_int_463|) (= (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_364) v_~z$w_buff0_used~0_363) (= v_~z$w_buff1_used~0_353 (ite (or .cse0 (and .cse6 .cse2)) 0 v_~z$w_buff1_used~0_354)) (let ((.cse7 (= |v_P2Thread1of1ForFork0_#t~mem19_58| |v_P2_#t~mem19_62|))) (or (and .cse7 .cse4 (= |v_P2_#t~ite21_53| v_~z$w_buff0~0_224) .cse5 (= |v_P2_#t~ite20_57| |v_P2Thread1of1ForFork0_#t~ite20_58|)) (and (= |v_P2_#t~ite20_57| |v_P2_#t~ite21_53|) (or .cse8 .cse9) (or (and (= |v_P2_#t~ite20_57| v_~z$w_buff1~0_234) .cse7 .cse6 .cse2) (and (= |v_P2_#t~ite20_57| |v_P2_#t~mem19_62|) (or .cse10 .cse11) (= (select .cse3 |v_~#z~0.offset_229|) |v_P2_#t~mem19_62|)))))))))) InVars {~#z~0.base=|v_~#z~0.base_229|, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_58|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_364, ~z$w_buff0~0=v_~z$w_buff0~0_224, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_104, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_354, #memory_int=|v_#memory_int_464|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_108, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_540, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_58|, ~#z~0.offset=|v_~#z~0.offset_229|} OutVars{~#z~0.base=|v_~#z~0.base_229|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_51|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_363, ~z$w_buff0~0=v_~z$w_buff0~0_224, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_103, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_353, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~#z~0.offset=|v_~#z~0.offset_229|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_31|, #memory_int=|v_#memory_int_463|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_107, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_539, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_51|} AuxVars[|v_P2_#t~mem19_62|, |v_P2_#t~ite21_53|, |v_P2_#t~ite20_57|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite21, ~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, #memory_int, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] and [679] L842-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~z$r_buff0_thd0~0_138 256) 0))) (let ((.cse14 (not (= (mod v_~z$w_buff0_used~0_399 256) 0))) (.cse4 (not .cse9)) (.cse7 (= (mod v_~z$r_buff1_thd0~0_130 256) 0)) (.cse8 (= 0 (mod v_~z$w_buff1_used~0_390 256))) (.cse10 (= (mod v_~z$w_buff0_used~0_400 256) 0))) (let ((.cse5 (not .cse10)) (.cse0 (select |v_#memory_int_500| |v_~#z~0.base_247|)) (.cse1 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (and .cse14 .cse4))) (and (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|) (= (store |v_#memory_int_500| |v_~#z~0.base_247| (store .cse0 |v_~#z~0.offset_247| |v_ULTIMATE.start_main_#t~ite30#1_134|)) |v_#memory_int_499|) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet31#1_101|) (= (ite (or (and .cse1 .cse2) .cse3) 0 v_~z$w_buff1_used~0_390) v_~z$w_buff1_used~0_389) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z$w_buff0_used~0_399 (ite (and .cse4 .cse5) 0 v_~z$w_buff0_used~0_400)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (let ((.cse6 (= |v_ULTIMATE.start_main_#t~mem28#1_169| |v_ULTIMATE.start_main_#t~mem28#1_167|))) (or (and .cse6 .cse4 (= v_~z$w_buff0~0_242 |v_ULTIMATE.start_main_#t~ite30#1_134|) (= |v_ULTIMATE.start_main_#t~ite29#1_170| |v_ULTIMATE.start_main_#t~ite29#1_168|) .cse5) (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~ite30#1_134|) (or (and (= |v_ULTIMATE.start_main_#t~ite29#1_168| |v_ULTIMATE.start_main_#t~mem28#1_167|) (= |v_ULTIMATE.start_main_#t~mem28#1_167| (select .cse0 |v_~#z~0.offset_247|)) (or .cse7 .cse8)) (and .cse6 (= |v_ULTIMATE.start_main_#t~ite29#1_168| v_~z$w_buff1~0_252) .cse1 .cse2)) (or .cse9 .cse10)))) (= v_~main$tmp_guard1~0_62 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_177 1) (= v_~__unbuffered_p2_EAX~0_79 1) (= v_~__unbuffered_p1_EAX~0_93 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= v_~main$tmp_guard0~0_128 (ite (= 0 (ite (= v_~__unbuffered_cnt~0_571 3) 1 0)) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61| (mod v_~main$tmp_guard0~0_128 256)) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem32#1_170| |v_ULTIMATE.start_main_#t~mem32#1_168|)) (.cse12 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_119 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_169| |v_ULTIMATE.start_main_#t~ite33#1_167|) (= v_~__unbuffered_p0_EAX~0_178 v_~__unbuffered_p0_EAX~0_177) .cse11 .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse13 (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_178) .cse11) (and (= (select (select |v_#memory_int_499| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124) |v_ULTIMATE.start_main_#t~mem32#1_168|) (not .cse13) (= |v_ULTIMATE.start_main_#t~ite33#1_167| |v_ULTIMATE.start_main_#t~mem32#1_168|)))) (not .cse12) (= |v_ULTIMATE.start_main_#t~ite33#1_167| v_~__unbuffered_p0_EAX~0_177)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= v_~z$r_buff1_thd0~0_129 (ite (or (and .cse14 (not (= (mod v_~z$r_buff0_thd0~0_137 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_389 256) 0)) .cse2)) 0 v_~z$r_buff1_thd0~0_130)) (= v_~z$r_buff0_thd0~0_137 (ite .cse3 0 v_~z$r_buff0_thd0~0_138)))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_170|, ~#z~0.base=|v_~#z~0.base_247|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_400, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_390, ~z$w_buff1~0=v_~z$w_buff1~0_252, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_101|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_170|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_138, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_130, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_169|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_500|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_169|} OutVars{~#z~0.base=|v_~#z~0.base_247|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ULTIMATE.start_main_#t~pre26#1=|v_ULTIMATE.start_main_#t~pre26#1_95|, ~z$w_buff1~0=v_~z$w_buff1~0_252, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_177, ~weak$$choice1~0=v_~weak$$choice1~0_166, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_93, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_79, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_119, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_399, ~z$w_buff0~0=v_~z$w_buff0~0_242, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_389, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_124, ~#z~0.offset=|v_~#z~0.offset_247|, ULTIMATE.start_main_#t~nondet27#1=|v_ULTIMATE.start_main_#t~nondet27#1_89|, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_133|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_37|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_124, #memory_int=|v_#memory_int_499|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_571, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[|v_ULTIMATE.start_main_#t~ite29#1_168|, |v_ULTIMATE.start_main_#t~mem28#1_167|, |v_ULTIMATE.start_main_#t~mem32#1_168|, |v_ULTIMATE.start_main_#t~ite33#1_167|, |v_ULTIMATE.start_main_#t~ite30#1_134|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre26#1, ULTIMATE.start_main_#t~ite34#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet27#1, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:49:30,085 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:49:30,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22426 [2022-12-13 00:49:30,086 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 307 flow [2022-12-13 00:49:30,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:49:30,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:30,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:30,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:49:30,088 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 1 more)] === [2022-12-13 00:49:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -385141108, now seen corresponding path program 1 times [2022-12-13 00:49:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:30,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454208591] [2022-12-13 00:49:30,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:30,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:49:30,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:49:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:49:30,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:49:30,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:49:30,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:49:30,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:49:30,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:49:30,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:49:30,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:49:30,302 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:30,307 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:49:30,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:49:30,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:49:30 BasicIcfg [2022-12-13 00:49:30,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:49:30,393 INFO L158 Benchmark]: Toolchain (without parser) took 39915.84ms. Allocated memory was 204.5MB in the beginning and 578.8MB in the end (delta: 374.3MB). Free memory was 178.4MB in the beginning and 403.2MB in the end (delta: -224.8MB). Peak memory consumption was 149.0MB. Max. memory is 8.0GB. [2022-12-13 00:49:30,393 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory was 180.9MB in the beginning and 180.9MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:49:30,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.18ms. Allocated memory is still 204.5MB. Free memory was 178.4MB in the beginning and 151.7MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:49:30,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 204.5MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:49:30,393 INFO L158 Benchmark]: Boogie Preprocessor took 48.01ms. Allocated memory is still 204.5MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:49:30,394 INFO L158 Benchmark]: RCFGBuilder took 737.66ms. Allocated memory is still 204.5MB. Free memory was 147.5MB in the beginning and 86.6MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-12-13 00:49:30,394 INFO L158 Benchmark]: TraceAbstraction took 38693.38ms. Allocated memory was 204.5MB in the beginning and 578.8MB in the end (delta: 374.3MB). Free memory was 85.6MB in the beginning and 403.2MB in the end (delta: -317.6MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2022-12-13 00:49:30,396 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.09ms. Allocated memory is still 204.5MB. Free memory was 180.9MB in the beginning and 180.9MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.18ms. Allocated memory is still 204.5MB. Free memory was 178.4MB in the beginning and 151.7MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 204.5MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.01ms. Allocated memory is still 204.5MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 737.66ms. Allocated memory is still 204.5MB. Free memory was 147.5MB in the beginning and 86.6MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. * TraceAbstraction took 38693.38ms. Allocated memory was 204.5MB in the beginning and 578.8MB in the end (delta: 374.3MB). Free memory was 85.6MB in the beginning and 403.2MB in the end (delta: -317.6MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 119 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1419, independent: 1328, independent conditional: 1328, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1419, independent: 1328, independent conditional: 0, independent unconditional: 1328, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1419, independent: 1328, independent conditional: 0, independent unconditional: 1328, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1419, independent: 1328, independent conditional: 0, independent unconditional: 1328, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 883, independent: 846, independent conditional: 0, independent unconditional: 846, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 883, independent: 818, independent conditional: 0, independent unconditional: 818, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 261, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1419, independent: 482, independent conditional: 0, independent unconditional: 482, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 883, unknown conditional: 0, unknown unconditional: 883] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1277, Positive conditional cache size: 0, Positive unconditional cache size: 1277, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, 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, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 152, independent conditional: 152, 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: 182, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 140, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 298, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 143, independent conditional: 143, 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: 171, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 171, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 362, independent: 315, independent conditional: 315, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 362, independent: 315, independent conditional: 19, independent unconditional: 296, dependent: 47, dependent conditional: 5, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 362, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 362, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 362, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 40 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 150, independent conditional: 24, independent unconditional: 126, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 222, Positive conditional cache size: 0, Positive unconditional cache size: 222, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 182, independent conditional: 182, 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: 214, independent: 182, independent conditional: 24, independent unconditional: 158, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 182, independent conditional: 6, independent unconditional: 176, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 182, independent conditional: 6, independent unconditional: 176, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 214, independent: 176, independent conditional: 4, independent unconditional: 172, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 234, Positive conditional cache size: 2, Positive unconditional cache size: 232, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 27, independent conditional: 21, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 27, independent conditional: 21, independent unconditional: 6, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 270, Positive conditional cache size: 8, Positive unconditional cache size: 262, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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.1s, 43 PlacesBefore, 43 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 95, independent conditional: 95, 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: 123, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, independent: 95, independent conditional: 72, independent unconditional: 23, 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: 131, independent: 95, independent conditional: 72, independent unconditional: 23, 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: 12, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, independent: 84, independent conditional: 62, independent unconditional: 22, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 12, unknown conditional: 10, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 305, Positive conditional cache size: 18, Positive unconditional cache size: 287, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.4s, 46 PlacesBefore, 41 PlacesAfterwards, 42 TransitionsBefore, 34 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 69, independent conditional: 69, 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: 69, independent: 69, independent conditional: 69, 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: 69, independent: 69, independent conditional: 39, independent unconditional: 30, 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: 69, independent: 69, independent conditional: 39, independent unconditional: 30, 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: 13, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 69, independent: 56, independent conditional: 29, independent unconditional: 27, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 439, Positive conditional cache size: 28, Positive unconditional cache size: 411, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((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_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$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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=-2, t1937={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1938; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 [L782] 1 x = 1 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_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$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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t1938, ((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_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$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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=-1, t1937={7:0}, t1938={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1939; [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((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_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$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_p1_EAX=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, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=0, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_p1_EAX = x [L797] 2 y = 1 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; VAL [\result={0:0}, __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_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$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_p1_EAX=1, __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, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __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_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$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_p1_EAX=1, __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, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = y [L812] 3 z = 1 [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 3 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 3 !(!cond) [L846] RET 3 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 \read(z) [L848] EXPR 3 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 3 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 3 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 3 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 3 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L855] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 3 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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_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$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_p1_EAX=1, __unbuffered_p2_EAX=1, 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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 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: 38.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 438 IncrementalHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 2 mSDtfsCounter, 438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 444 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:49:30,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...