/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:36:47,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:36:47,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:36:47,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:36:47,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:36:47,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:36:47,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:36:47,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:36:47,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:36:47,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:36:47,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:36:47,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:36:47,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:36:47,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:36:47,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:36:47,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:36:47,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:36:47,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:36:47,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:36:47,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:36:47,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:36:47,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:36:47,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:36:47,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:36:47,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:36:47,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:36:47,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:36:47,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:36:47,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:36:47,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:36:47,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:36:47,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:36:47,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:36:47,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:36:47,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:36:47,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:36:47,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:36:47,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:36:47,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:36:47,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:36:47,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:36:47,886 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:36:47,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:36:47,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:36:47,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:36:47,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:36:47,914 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:36:47,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:36:47,915 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:36:47,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:36:47,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:36:47,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:36:47,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:36:47,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:36:47,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:36:47,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:36:47,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:36:47,917 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:36:47,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:36:47,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:36:47,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:36:47,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:36:47,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:36:47,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:36:47,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:36:47,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:36:47,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:36:47,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:36:47,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:36:47,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:36:47,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:36:48,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:36:48,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:36:48,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:36:48,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:36:48,266 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:36:48,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i [2022-12-06 06:36:49,373 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:36:49,677 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:36:49,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i [2022-12-06 06:36:49,693 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1319427dd/ff7f63dbe8ca4fdca4ae0af4f87098fd/FLAG76ed6779d [2022-12-06 06:36:49,705 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1319427dd/ff7f63dbe8ca4fdca4ae0af4f87098fd [2022-12-06 06:36:49,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:36:49,709 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:36:49,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:36:49,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:36:49,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:36:49,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:36:49" (1/1) ... [2022-12-06 06:36:49,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa1f804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:49, skipping insertion in model container [2022-12-06 06:36:49,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:36:49" (1/1) ... [2022-12-06 06:36:49,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:36:49,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:36:49,889 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/safe008_power.opt.i[951,964] [2022-12-06 06:36:50,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:36:50,111 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:36:50,123 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.opt.i[951,964] [2022-12-06 06:36:50,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:36:50,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:36:50,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:36:50,219 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:36:50,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50 WrapperNode [2022-12-06 06:36:50,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:36:50,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:36:50,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:36:50,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:36:50,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,277 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-12-06 06:36:50,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:36:50,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:36:50,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:36:50,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:36:50,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,330 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:36:50,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:36:50,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:36:50,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:36:50,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (1/1) ... [2022-12-06 06:36:50,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:36:50,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:36:50,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:36:50,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:36:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:36:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:36:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:36:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:36:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:36:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:36:50,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:36:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:36:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:36:50,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:36:50,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:36:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:36:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:36:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:36:50,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:36:50,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:36:50,463 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:36:50,635 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:36:50,636 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:36:51,095 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:36:51,379 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:36:51,380 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:36:51,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:36:51 BoogieIcfgContainer [2022-12-06 06:36:51,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:36:51,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:36:51,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:36:51,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:36:51,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:36:49" (1/3) ... [2022-12-06 06:36:51,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c3bf56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:36:51, skipping insertion in model container [2022-12-06 06:36:51,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:36:50" (2/3) ... [2022-12-06 06:36:51,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c3bf56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:36:51, skipping insertion in model container [2022-12-06 06:36:51,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:36:51" (3/3) ... [2022-12-06 06:36:51,390 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.opt.i [2022-12-06 06:36:51,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:36:51,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:36:51,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:36:51,484 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:36:51,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 06:36:51,574 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:36:51,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:51,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:36:51,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 06:36:51,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:51,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:36:51,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:51,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:51,639 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:36:51,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:36:51,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:36:51,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 06:36:51,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 06:37:04,225 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 06:37:04,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:37:04,244 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;@4d668d6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:37:04,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:37:04,253 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 06:37:04,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:04,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:04,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 06:37:04,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash 25707068, now seen corresponding path program 1 times [2022-12-06 06:37:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:04,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902238754] [2022-12-06 06:37:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:04,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:04,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902238754] [2022-12-06 06:37:04,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902238754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:04,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:04,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:37:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437997029] [2022-12-06 06:37:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:04,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:04,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:04,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:04,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 06:37:04,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:04,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:04,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 06:37:04,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:05,180 INFO L130 PetriNetUnfolder]: 1130/1694 cut-off events. [2022-12-06 06:37:05,181 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 06:37:05,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1694 events. 1130/1694 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8462 event pairs, 386 based on Foata normal form. 0/1491 useless extension candidates. Maximal degree in co-relation 3426. Up to 1078 conditions per place. [2022-12-06 06:37:05,193 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 30 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-06 06:37:05,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2022-12-06 06:37:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 06:37:05,204 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:37:05,206 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 51 transitions. [2022-12-06 06:37:05,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2022-12-06 06:37:05,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:05,210 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 06:37:05,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-06 06:37:05,215 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 06:37:05,215 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:05,216 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 06:37:05,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:05,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:05,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 06:37:05,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:37:05,226 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:37:05,226 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:05,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:37:05,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:37:05,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:37:05,409 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:05,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 06:37:05,412 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 06:37:05,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:05,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:05,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:05,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:37:05,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -734399971, now seen corresponding path program 1 times [2022-12-06 06:37:05,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960380285] [2022-12-06 06:37:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:05,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960380285] [2022-12-06 06:37:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960380285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:05,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206650841] [2022-12-06 06:37:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:05,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:05,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:05,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:37:05,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:05,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:05,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:37:05,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:06,017 INFO L130 PetriNetUnfolder]: 676/1090 cut-off events. [2022-12-06 06:37:06,017 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 06:37:06,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1090 events. 676/1090 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4935 event pairs, 184 based on Foata normal form. 20/1106 useless extension candidates. Maximal degree in co-relation 2233. Up to 773 conditions per place. [2022-12-06 06:37:06,026 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 06:37:06,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 128 flow [2022-12-06 06:37:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:37:06,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:37:06,028 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:37:06,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 128 flow [2022-12-06 06:37:06,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:06,030 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 06:37:06,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 06:37:06,032 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 06:37:06,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:06,032 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:37:06,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:06,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:06,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:37:06,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 06:37:06,040 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:37:06,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:37:06,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:37:06,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 06:37:06,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 06:37:06,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:06,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 06:37:06,086 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 06:37:06,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:06,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:06,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:06,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:37:06,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:06,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1291562933, now seen corresponding path program 1 times [2022-12-06 06:37:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:06,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595003122] [2022-12-06 06:37:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:06,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595003122] [2022-12-06 06:37:06,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595003122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:06,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:06,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:37:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695487392] [2022-12-06 06:37:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:06,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:06,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:37:06,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:06,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:06,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:37:06,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:06,589 INFO L130 PetriNetUnfolder]: 639/1050 cut-off events. [2022-12-06 06:37:06,590 INFO L131 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2022-12-06 06:37:06,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 1050 events. 639/1050 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4982 event pairs, 120 based on Foata normal form. 15/1060 useless extension candidates. Maximal degree in co-relation 2236. Up to 805 conditions per place. [2022-12-06 06:37:06,597 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-06 06:37:06,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 143 flow [2022-12-06 06:37:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:37:06,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-06 06:37:06,599 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:37:06,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 143 flow [2022-12-06 06:37:06,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:06,601 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2022-12-06 06:37:06,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:37:06,602 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2022-12-06 06:37:06,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:06,602 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 60 flow [2022-12-06 06:37:06,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:06,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:06,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2022-12-06 06:37:06,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2022-12-06 06:37:06,610 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:37:06,610 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:37:06,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:37:06,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2022-12-06 06:37:06,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 06:37:06,615 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:06,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:37:06,616 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2022-12-06 06:37:06,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:06,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:06,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:06,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:37:06,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1407155810, now seen corresponding path program 1 times [2022-12-06 06:37:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:06,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657554120] [2022-12-06 06:37:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:06,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:06,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657554120] [2022-12-06 06:37:06,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657554120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:06,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:06,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:37:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874613849] [2022-12-06 06:37:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:06,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:06,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:06,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:06,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:37:06,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:06,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:06,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:37:06,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:07,124 INFO L130 PetriNetUnfolder]: 801/1210 cut-off events. [2022-12-06 06:37:07,124 INFO L131 PetriNetUnfolder]: For 258/258 co-relation queries the response was YES. [2022-12-06 06:37:07,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2821 conditions, 1210 events. 801/1210 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5014 event pairs, 385 based on Foata normal form. 3/1212 useless extension candidates. Maximal degree in co-relation 2809. Up to 1146 conditions per place. [2022-12-06 06:37:07,133 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-06 06:37:07,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 156 flow [2022-12-06 06:37:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:37:07,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:37:07,135 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:37:07,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 156 flow [2022-12-06 06:37:07,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:07,137 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 75 flow [2022-12-06 06:37:07,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 06:37:07,137 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2022-12-06 06:37:07,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:07,138 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 75 flow [2022-12-06 06:37:07,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:07,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:07,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 75 flow [2022-12-06 06:37:07,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 75 flow [2022-12-06 06:37:07,146 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 06:37:07,146 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 06:37:07,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 31 events. 3/31 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2022-12-06 06:37:07,147 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 75 flow [2022-12-06 06:37:07,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 06:37:07,163 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:07,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:37:07,164 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 75 flow [2022-12-06 06:37:07,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:07,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:07,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:07,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:37:07,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:07,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash 792477127, now seen corresponding path program 1 times [2022-12-06 06:37:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:07,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057230852] [2022-12-06 06:37:07,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:07,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:07,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057230852] [2022-12-06 06:37:07,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057230852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:07,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:07,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306998037] [2022-12-06 06:37:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:07,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:07,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:07,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:37:07,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:07,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:07,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:37:07,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:07,749 INFO L130 PetriNetUnfolder]: 1197/1857 cut-off events. [2022-12-06 06:37:07,749 INFO L131 PetriNetUnfolder]: For 935/935 co-relation queries the response was YES. [2022-12-06 06:37:07,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4301 conditions, 1857 events. 1197/1857 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8812 event pairs, 295 based on Foata normal form. 76/1921 useless extension candidates. Maximal degree in co-relation 4288. Up to 746 conditions per place. [2022-12-06 06:37:07,760 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 34 selfloop transitions, 3 changer transitions 7/46 dead transitions. [2022-12-06 06:37:07,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 222 flow [2022-12-06 06:37:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 06:37:07,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2022-12-06 06:37:07,762 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 75 flow. Second operand 4 states and 47 transitions. [2022-12-06 06:37:07,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 222 flow [2022-12-06 06:37:07,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:37:07,764 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 86 flow [2022-12-06 06:37:07,764 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 06:37:07,765 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2022-12-06 06:37:07,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:07,765 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 86 flow [2022-12-06 06:37:07,766 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:07,766 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:07,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 86 flow [2022-12-06 06:37:07,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 86 flow [2022-12-06 06:37:07,774 INFO L130 PetriNetUnfolder]: 3/31 cut-off events. [2022-12-06 06:37:07,774 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 06:37:07,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 31 events. 3/31 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2022-12-06 06:37:07,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 86 flow [2022-12-06 06:37:07,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 06:37:09,026 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:37:09,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1262 [2022-12-06 06:37:09,028 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 88 flow [2022-12-06 06:37:09,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:09,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:09,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:09,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:37:09,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:09,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -117657471, now seen corresponding path program 1 times [2022-12-06 06:37:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:09,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889900791] [2022-12-06 06:37:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:10,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889900791] [2022-12-06 06:37:10,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889900791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:10,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:10,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:37:10,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971383486] [2022-12-06 06:37:10,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:10,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:37:10,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:10,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:37:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:37:10,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 06:37:10,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:10,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:10,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 06:37:10,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:10,471 INFO L130 PetriNetUnfolder]: 655/1011 cut-off events. [2022-12-06 06:37:10,471 INFO L131 PetriNetUnfolder]: For 957/957 co-relation queries the response was YES. [2022-12-06 06:37:10,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2677 conditions, 1011 events. 655/1011 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4012 event pairs, 230 based on Foata normal form. 5/1016 useless extension candidates. Maximal degree in co-relation 2661. Up to 882 conditions per place. [2022-12-06 06:37:10,479 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 40 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2022-12-06 06:37:10,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 275 flow [2022-12-06 06:37:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 06:37:10,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 06:37:10,480 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 88 flow. Second operand 5 states and 54 transitions. [2022-12-06 06:37:10,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 275 flow [2022-12-06 06:37:10,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 247 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-06 06:37:10,484 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 130 flow [2022-12-06 06:37:10,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 06:37:10,485 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 06:37:10,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:10,485 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 130 flow [2022-12-06 06:37:10,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:10,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:10,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 130 flow [2022-12-06 06:37:10,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 130 flow [2022-12-06 06:37:10,502 INFO L130 PetriNetUnfolder]: 24/90 cut-off events. [2022-12-06 06:37:10,502 INFO L131 PetriNetUnfolder]: For 88/101 co-relation queries the response was YES. [2022-12-06 06:37:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 90 events. 24/90 cut-off events. For 88/101 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 376 event pairs, 5 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 209. Up to 30 conditions per place. [2022-12-06 06:37:10,504 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 130 flow [2022-12-06 06:37:10,504 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 06:37:10,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [675] L829-->L836: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_43 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse3 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse11 (not (= 0 (mod v_~x$w_buff0_used~0_210 256)))) (.cse9 (not .cse8))) (let ((.cse0 (and .cse11 .cse9)) (.cse4 (not .cse2)) (.cse1 (select |v_#memory_int_178| |v_~#x~0.base_122|)) (.cse6 (not .cse3)) (.cse10 (not .cse7))) (and (= v_~x$r_buff0_thd3~0_42 (ite .cse0 0 v_~x$r_buff0_thd3~0_43)) (let ((.cse5 (= |v_P2_#t~mem25_32| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (= (select .cse1 |v_~#x~0.offset_122|) |v_P2_#t~mem25_32|) (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse2 .cse3)) (and .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_75) .cse5 .cse6)) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_23|) (or .cse7 .cse8)) (and .cse9 .cse5 .cse10 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork1_#t~ite26_1|) (= |v_P2_#t~ite27_23| v_~x$w_buff0~0_84)))) (= (ite (or .cse0 (and .cse4 .cse6)) 0 v_~x$w_buff1_used~0_188) v_~x$w_buff1_used~0_187) (= |v_#memory_int_177| (store |v_#memory_int_178| |v_~#x~0.base_122| (store .cse1 |v_~#x~0.offset_122| |v_P2_#t~ite27_23|))) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_187 256))) .cse6) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_42 256) 0)))) 0 v_~x$r_buff1_thd3~0_37)) (= v_~x$w_buff0_used~0_210 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_211)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_122|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_178|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_122|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_177|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_23|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 06:37:11,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [668] L809-->L816: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_100 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd2~0_94 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse6 (not .cse8)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse0 (and .cse6 .cse11)) (.cse1 (select |v_#memory_int_166| |v_~#x~0.base_116|)) (.cse2 (not .cse9)) (.cse3 (not .cse10)) (.cse5 (not .cse7))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_100) v_~x$r_buff0_thd2~0_99) (= (store |v_#memory_int_166| |v_~#x~0.base_116| (store .cse1 |v_~#x~0.offset_116| |v_P1_#t~ite24_25|)) |v_#memory_int_165|) (= (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_180) v_~x$w_buff1_used~0_179) (let ((.cse4 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_36|))) (or (and .cse4 (= |v_P1_#t~ite23_31| |v_P1Thread1of1ForFork0_#t~ite23_1|) (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_82) .cse5 .cse6) (and (= |v_P1_#t~ite23_31| |v_P1_#t~ite24_25|) (or .cse7 .cse8) (or (and (= |v_P1_#t~ite23_31| |v_P1_#t~mem22_36|) (or .cse9 .cse10) (= |v_P1_#t~mem22_36| (select .cse1 |v_~#x~0.offset_116|))) (and .cse2 .cse4 .cse3 (= |v_P1_#t~ite23_31| v_~x$w_buff1~0_69)))))) (= v_~x$r_buff1_thd2~0_93 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_179 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_99 256) 0)) .cse11)) 0 v_~x$r_buff1_thd2~0_94)) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_82, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, #memory_int=|v_#memory_int_166|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_82, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_165|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_179, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~ite23_31|, |v_P1_#t~mem22_36|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-06 06:37:14,730 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:37:14,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4246 [2022-12-06 06:37:14,731 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 137 flow [2022-12-06 06:37:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:14,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:14,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:14,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:37:14,732 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1383698079, now seen corresponding path program 1 times [2022-12-06 06:37:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011945615] [2022-12-06 06:37:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:14,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011945615] [2022-12-06 06:37:14,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011945615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:14,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:14,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661622381] [2022-12-06 06:37:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:14,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:14,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 06:37:14,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 137 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:14,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:14,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 06:37:14,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:15,174 INFO L130 PetriNetUnfolder]: 843/1317 cut-off events. [2022-12-06 06:37:15,174 INFO L131 PetriNetUnfolder]: For 1173/1173 co-relation queries the response was YES. [2022-12-06 06:37:15,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 1317 events. 843/1317 cut-off events. For 1173/1173 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5644 event pairs, 353 based on Foata normal form. 43/1350 useless extension candidates. Maximal degree in co-relation 3669. Up to 844 conditions per place. [2022-12-06 06:37:15,182 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 36 selfloop transitions, 3 changer transitions 3/42 dead transitions. [2022-12-06 06:37:15,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 277 flow [2022-12-06 06:37:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 06:37:15,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 06:37:15,185 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 137 flow. Second operand 3 states and 39 transitions. [2022-12-06 06:37:15,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 277 flow [2022-12-06 06:37:15,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 263 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 06:37:15,188 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 140 flow [2022-12-06 06:37:15,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-06 06:37:15,189 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-06 06:37:15,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:15,190 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 140 flow [2022-12-06 06:37:15,190 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:15,190 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:15,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 140 flow [2022-12-06 06:37:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 140 flow [2022-12-06 06:37:15,231 INFO L130 PetriNetUnfolder]: 24/104 cut-off events. [2022-12-06 06:37:15,232 INFO L131 PetriNetUnfolder]: For 147/166 co-relation queries the response was YES. [2022-12-06 06:37:15,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 104 events. 24/104 cut-off events. For 147/166 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 472 event pairs, 6 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 257. Up to 38 conditions per place. [2022-12-06 06:37:15,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 140 flow [2022-12-06 06:37:15,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:37:15,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [812] $Ultimate##0-->L829: Formula: (and (= v_~z~0_89 1) (= v_~y~0_45 v_~__unbuffered_p2_EAX~0_72) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~y~0=v_~y~0_45} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_72, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_89, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [795] $Ultimate##0-->L761: Formula: (and (= |v_P0Thread1of1ForFork2_~arg#1.base_5| |v_P0Thread1of1ForFork2_#in~arg#1.base_5|) (= |v_P0Thread1of1ForFork2_~arg#1.offset_5| |v_P0Thread1of1ForFork2_#in~arg#1.offset_5|) (= v_~z~0_48 2)) InVars {P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_5|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_5|} OutVars{P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_5|, ~z~0=v_~z~0_48, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_5|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_5|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_5|} AuxVars[] AssignedVars[~z~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:37:15,369 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:37:15,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 06:37:15,370 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 143 flow [2022-12-06 06:37:15,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:15,370 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:15,370 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:15,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:37:15,371 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash 24945718, now seen corresponding path program 1 times [2022-12-06 06:37:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:15,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284475300] [2022-12-06 06:37:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284475300] [2022-12-06 06:37:16,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284475300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:16,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:16,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675248549] [2022-12-06 06:37:16,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:16,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:37:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:37:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:37:16,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 06:37:16,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:16,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:16,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 06:37:16,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:17,066 INFO L130 PetriNetUnfolder]: 786/1251 cut-off events. [2022-12-06 06:37:17,066 INFO L131 PetriNetUnfolder]: For 1253/1295 co-relation queries the response was YES. [2022-12-06 06:37:17,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3487 conditions, 1251 events. 786/1251 cut-off events. For 1253/1295 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5761 event pairs, 100 based on Foata normal form. 29/1277 useless extension candidates. Maximal degree in co-relation 3469. Up to 849 conditions per place. [2022-12-06 06:37:17,073 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 42 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2022-12-06 06:37:17,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 318 flow [2022-12-06 06:37:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 06:37:17,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.472 [2022-12-06 06:37:17,075 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 143 flow. Second operand 5 states and 59 transitions. [2022-12-06 06:37:17,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 318 flow [2022-12-06 06:37:17,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:37:17,079 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 182 flow [2022-12-06 06:37:17,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-06 06:37:17,082 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 06:37:17,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:17,082 INFO L89 Accepts]: Start accepts. Operand has 44 places, 31 transitions, 182 flow [2022-12-06 06:37:17,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:17,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:17,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 182 flow [2022-12-06 06:37:17,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 182 flow [2022-12-06 06:37:17,108 INFO L130 PetriNetUnfolder]: 44/133 cut-off events. [2022-12-06 06:37:17,108 INFO L131 PetriNetUnfolder]: For 357/408 co-relation queries the response was YES. [2022-12-06 06:37:17,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 133 events. 44/133 cut-off events. For 357/408 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 561 event pairs, 4 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 432. Up to 71 conditions per place. [2022-12-06 06:37:17,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 182 flow [2022-12-06 06:37:17,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:37:17,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [668] L809-->L816: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd2~0_100 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd2~0_94 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_180 256) 0)) (.cse6 (not .cse8)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse0 (and .cse6 .cse11)) (.cse1 (select |v_#memory_int_166| |v_~#x~0.base_116|)) (.cse2 (not .cse9)) (.cse3 (not .cse10)) (.cse5 (not .cse7))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_100) v_~x$r_buff0_thd2~0_99) (= (store |v_#memory_int_166| |v_~#x~0.base_116| (store .cse1 |v_~#x~0.offset_116| |v_P1_#t~ite24_25|)) |v_#memory_int_165|) (= (ite (or .cse0 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_180) v_~x$w_buff1_used~0_179) (let ((.cse4 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_36|))) (or (and .cse4 (= |v_P1_#t~ite23_31| |v_P1Thread1of1ForFork0_#t~ite23_1|) (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_82) .cse5 .cse6) (and (= |v_P1_#t~ite23_31| |v_P1_#t~ite24_25|) (or .cse7 .cse8) (or (and (= |v_P1_#t~ite23_31| |v_P1_#t~mem22_36|) (or .cse9 .cse10) (= |v_P1_#t~mem22_36| (select .cse1 |v_~#x~0.offset_116|))) (and .cse2 .cse4 .cse3 (= |v_P1_#t~ite23_31| v_~x$w_buff1~0_69)))))) (= v_~x$r_buff1_thd2~0_93 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_179 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_99 256) 0)) .cse11)) 0 v_~x$r_buff1_thd2~0_94)) (= (ite (and .cse5 .cse6) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_82, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, #memory_int=|v_#memory_int_166|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_180, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_82, ~#x~0.offset=|v_~#x~0.offset_116|, ~x$w_buff1~0=v_~x$w_buff1~0_69, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_165|, ~#x~0.base=|v_~#x~0.base_116|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_179, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~ite23_31|, |v_P1_#t~mem22_36|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-06 06:37:17,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [660] L761-->L773: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [675] L829-->L836: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_43 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff0_used~0_211 256) 0)) (.cse3 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse2 (= (mod v_~x$w_buff1_used~0_188 256) 0)) (.cse11 (not (= 0 (mod v_~x$w_buff0_used~0_210 256)))) (.cse9 (not .cse8))) (let ((.cse0 (and .cse11 .cse9)) (.cse4 (not .cse2)) (.cse1 (select |v_#memory_int_178| |v_~#x~0.base_122|)) (.cse6 (not .cse3)) (.cse10 (not .cse7))) (and (= v_~x$r_buff0_thd3~0_42 (ite .cse0 0 v_~x$r_buff0_thd3~0_43)) (let ((.cse5 (= |v_P2_#t~mem25_32| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (= (select .cse1 |v_~#x~0.offset_122|) |v_P2_#t~mem25_32|) (= |v_P2_#t~ite26_29| |v_P2_#t~mem25_32|) (or .cse2 .cse3)) (and .cse4 (= |v_P2_#t~ite26_29| v_~x$w_buff1~0_75) .cse5 .cse6)) (= |v_P2_#t~ite26_29| |v_P2_#t~ite27_23|) (or .cse7 .cse8)) (and .cse9 .cse5 .cse10 (= |v_P2_#t~ite26_29| |v_P2Thread1of1ForFork1_#t~ite26_1|) (= |v_P2_#t~ite27_23| v_~x$w_buff0~0_84)))) (= (ite (or .cse0 (and .cse4 .cse6)) 0 v_~x$w_buff1_used~0_188) v_~x$w_buff1_used~0_187) (= |v_#memory_int_177| (store |v_#memory_int_178| |v_~#x~0.base_122| (store .cse1 |v_~#x~0.offset_122| |v_P2_#t~ite27_23|))) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_187 256))) .cse6) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_42 256) 0)))) 0 v_~x$r_buff1_thd3~0_37)) (= v_~x$w_buff0_used~0_210 (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_211)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_122|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_178|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_188, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_43, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_84, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_122|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_177|, ~#x~0.base=|v_~#x~0.base_122|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_210} AuxVars[|v_P2_#t~mem25_32|, |v_P2_#t~ite26_29|, |v_P2_#t~ite27_23|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-06 06:37:18,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:37:18,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1179 [2022-12-06 06:37:18,261 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 186 flow [2022-12-06 06:37:18,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:18,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:18,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:18,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:37:18,261 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 54889506, now seen corresponding path program 1 times [2022-12-06 06:37:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:18,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806554607] [2022-12-06 06:37:18,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:20,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806554607] [2022-12-06 06:37:20,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806554607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:20,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:20,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:37:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677044449] [2022-12-06 06:37:20,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:20,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:37:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:37:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:37:20,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 06:37:20,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:20,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:20,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 06:37:20,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:20,475 INFO L130 PetriNetUnfolder]: 774/1227 cut-off events. [2022-12-06 06:37:20,475 INFO L131 PetriNetUnfolder]: For 2551/2641 co-relation queries the response was YES. [2022-12-06 06:37:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1227 events. 774/1227 cut-off events. For 2551/2641 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5584 event pairs, 106 based on Foata normal form. 38/1265 useless extension candidates. Maximal degree in co-relation 4195. Up to 886 conditions per place. [2022-12-06 06:37:20,482 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 40 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2022-12-06 06:37:20,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 373 flow [2022-12-06 06:37:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 06:37:20,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2022-12-06 06:37:20,485 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 186 flow. Second operand 5 states and 59 transitions. [2022-12-06 06:37:20,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 373 flow [2022-12-06 06:37:20,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 346 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:37:20,494 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 219 flow [2022-12-06 06:37:20,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-06 06:37:20,495 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 06:37:20,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:20,496 INFO L89 Accepts]: Start accepts. Operand has 44 places, 34 transitions, 219 flow [2022-12-06 06:37:20,496 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:20,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:20,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 34 transitions, 219 flow [2022-12-06 06:37:20,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 34 transitions, 219 flow [2022-12-06 06:37:20,538 INFO L130 PetriNetUnfolder]: 87/216 cut-off events. [2022-12-06 06:37:20,539 INFO L131 PetriNetUnfolder]: For 519/627 co-relation queries the response was YES. [2022-12-06 06:37:20,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 216 events. 87/216 cut-off events. For 519/627 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1056 event pairs, 14 based on Foata normal form. 2/188 useless extension candidates. Maximal degree in co-relation 704. Up to 121 conditions per place. [2022-12-06 06:37:20,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 34 transitions, 219 flow [2022-12-06 06:37:20,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:37:20,545 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:20,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 06:37:20,546 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 219 flow [2022-12-06 06:37:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:20,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:20,546 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:20,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:37:20,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 55038616, now seen corresponding path program 1 times [2022-12-06 06:37:20,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233875028] [2022-12-06 06:37:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233875028] [2022-12-06 06:37:20,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233875028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:20,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:20,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:37:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959417925] [2022-12-06 06:37:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:20,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:37:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:37:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:37:20,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 06:37:20,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:20,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:20,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 06:37:20,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:20,946 INFO L130 PetriNetUnfolder]: 472/805 cut-off events. [2022-12-06 06:37:20,946 INFO L131 PetriNetUnfolder]: For 1768/1773 co-relation queries the response was YES. [2022-12-06 06:37:20,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 805 events. 472/805 cut-off events. For 1768/1773 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3515 event pairs, 91 based on Foata normal form. 41/839 useless extension candidates. Maximal degree in co-relation 2897. Up to 635 conditions per place. [2022-12-06 06:37:20,952 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 49 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2022-12-06 06:37:20,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 440 flow [2022-12-06 06:37:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:37:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:37:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 06:37:20,953 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 06:37:20,953 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 219 flow. Second operand 3 states and 48 transitions. [2022-12-06 06:37:20,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 440 flow [2022-12-06 06:37:20,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 398 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 06:37:20,958 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 217 flow [2022-12-06 06:37:20,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-06 06:37:20,959 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 06:37:20,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:20,959 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 217 flow [2022-12-06 06:37:20,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:20,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:20,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 217 flow [2022-12-06 06:37:20,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 217 flow [2022-12-06 06:37:21,012 INFO L130 PetriNetUnfolder]: 153/371 cut-off events. [2022-12-06 06:37:21,012 INFO L131 PetriNetUnfolder]: For 492/550 co-relation queries the response was YES. [2022-12-06 06:37:21,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 371 events. 153/371 cut-off events. For 492/550 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2133 event pairs, 37 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 1080. Up to 161 conditions per place. [2022-12-06 06:37:21,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 217 flow [2022-12-06 06:37:21,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:37:21,017 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:37:21,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 06:37:21,019 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 217 flow [2022-12-06 06:37:21,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:21,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:21,019 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:21,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:37:21,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -362844396, now seen corresponding path program 1 times [2022-12-06 06:37:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:21,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107436731] [2022-12-06 06:37:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:21,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107436731] [2022-12-06 06:37:21,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107436731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:21,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:21,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:37:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651113719] [2022-12-06 06:37:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:21,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:37:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:37:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:37:21,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 06:37:21,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:21,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:21,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 06:37:21,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:21,428 INFO L130 PetriNetUnfolder]: 250/465 cut-off events. [2022-12-06 06:37:21,429 INFO L131 PetriNetUnfolder]: For 751/752 co-relation queries the response was YES. [2022-12-06 06:37:21,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 465 events. 250/465 cut-off events. For 751/752 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1902 event pairs, 43 based on Foata normal form. 46/504 useless extension candidates. Maximal degree in co-relation 1794. Up to 159 conditions per place. [2022-12-06 06:37:21,432 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 57 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2022-12-06 06:37:21,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 496 flow [2022-12-06 06:37:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:37:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:37:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 06:37:21,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2022-12-06 06:37:21,433 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 217 flow. Second operand 4 states and 59 transitions. [2022-12-06 06:37:21,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 496 flow [2022-12-06 06:37:21,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:37:21,436 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 253 flow [2022-12-06 06:37:21,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 06:37:21,437 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2022-12-06 06:37:21,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:21,437 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 253 flow [2022-12-06 06:37:21,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:21,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:21,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 253 flow [2022-12-06 06:37:21,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 253 flow [2022-12-06 06:37:21,468 INFO L130 PetriNetUnfolder]: 70/204 cut-off events. [2022-12-06 06:37:21,468 INFO L131 PetriNetUnfolder]: For 306/334 co-relation queries the response was YES. [2022-12-06 06:37:21,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 204 events. 70/204 cut-off events. For 306/334 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 994 event pairs, 7 based on Foata normal form. 13/205 useless extension candidates. Maximal degree in co-relation 676. Up to 89 conditions per place. [2022-12-06 06:37:21,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 253 flow [2022-12-06 06:37:21,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 06:37:22,872 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:37:22,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1436 [2022-12-06 06:37:22,873 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 267 flow [2022-12-06 06:37:22,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:22,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:22,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:22,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:37:22,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1636893661, now seen corresponding path program 1 times [2022-12-06 06:37:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:22,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891132653] [2022-12-06 06:37:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:22,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:37:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:37:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:37:23,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891132653] [2022-12-06 06:37:23,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891132653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:37:23,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:37:23,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:37:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884981568] [2022-12-06 06:37:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:37:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:37:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:37:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:37:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:37:23,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 06:37:23,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:23,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:37:23,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 06:37:23,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:37:23,256 INFO L130 PetriNetUnfolder]: 210/383 cut-off events. [2022-12-06 06:37:23,256 INFO L131 PetriNetUnfolder]: For 852/852 co-relation queries the response was YES. [2022-12-06 06:37:23,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 383 events. 210/383 cut-off events. For 852/852 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1505 event pairs, 38 based on Foata normal form. 18/394 useless extension candidates. Maximal degree in co-relation 1567. Up to 159 conditions per place. [2022-12-06 06:37:23,259 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 39 selfloop transitions, 10 changer transitions 15/64 dead transitions. [2022-12-06 06:37:23,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 514 flow [2022-12-06 06:37:23,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:37:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:37:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 06:37:23,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4206896551724138 [2022-12-06 06:37:23,260 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 267 flow. Second operand 5 states and 61 transitions. [2022-12-06 06:37:23,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 514 flow [2022-12-06 06:37:23,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 470 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-06 06:37:23,264 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 214 flow [2022-12-06 06:37:23,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-12-06 06:37:23,264 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2022-12-06 06:37:23,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:37:23,265 INFO L89 Accepts]: Start accepts. Operand has 48 places, 33 transitions, 214 flow [2022-12-06 06:37:23,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:37:23,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:37:23,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 33 transitions, 214 flow [2022-12-06 06:37:23,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 214 flow [2022-12-06 06:37:23,291 INFO L130 PetriNetUnfolder]: 20/62 cut-off events. [2022-12-06 06:37:23,292 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-06 06:37:23,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 62 events. 20/62 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 186 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 203. Up to 19 conditions per place. [2022-12-06 06:37:23,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 214 flow [2022-12-06 06:37:23,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 06:37:24,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L809: Formula: (let ((.cse25 (mod v_~x$w_buff0_used~0_489 256)) (.cse26 (mod v_~weak$$choice0~0_99 256)) (.cse3 (= (mod v_~x$w_buff0_used~0_488 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd2~0_222 256) 0))) (let ((.cse21 (not .cse20)) (.cse5 (not .cse3)) (.cse9 (= (mod v_~weak$$choice2~0_90 256) 0)) (.cse17 (= .cse26 0)) (.cse16 (= (mod v_~x$w_buff1_used~0_440 256) 0)) (.cse23 (= 0 .cse25)) (.cse1 (select |v_#memory_int_470| |v_~#x~0.base_246|))) (let ((.cse0 (select .cse1 |v_~#x~0.offset_246|)) (.cse10 (not .cse23)) (.cse14 (not .cse16)) (.cse8 (not .cse17)) (.cse18 (= (mod v_~weak$$choice1~0_134 256) 0)) (.cse2 (not .cse9)) (.cse24 (and .cse21 .cse5)) (.cse6 (not (= (mod v_~x$w_buff1_used~0_439 256) 0))) (.cse7 (= (mod v_~x$r_buff1_thd2~0_231 256) 0))) (and (= v_~x$mem_tmp~0_58 .cse0) (= v_~__unbuffered_p1_EAX$read_delayed~0_96 1) (= (store |v_#memory_int_470| |v_~#x~0.base_246| (store .cse1 |v_~#x~0.offset_246| |v_P1_#t~ite21_54|)) |v_#memory_int_469|) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$r_buff1_thd2~0_230 (ite .cse2 v_~x$r_buff1_thd2~0_231 (ite .cse3 v_~x$r_buff1_thd2~0_231 (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_221 256) 0))) (ite (and (not .cse4) .cse5) 0 (ite (and .cse4 .cse6 .cse7 .cse5) (ite .cse8 v_~x$r_buff1_thd2~0_231 0) 0)))))) (or (and .cse9 (= v_~__unbuffered_p1_EAX~0_148 |v_P1_#t~mem20_57|) (= |v_P1_#t~ite21_54| |v_P1_#t~mem20_57|)) (and .cse2 (= |v_P1_#t~ite21_54| v_~x$mem_tmp~0_58) (= |v_P1Thread1of1ForFork0_#t~mem20_46| |v_P1_#t~mem20_57|))) (let ((.cse13 (= |v_P1Thread1of1ForFork0_#t~mem13_46| |v_P1_#t~mem13_97|)) (.cse11 (= |v_P1_#t~ite12_78| |v_P1Thread1of1ForFork0_#t~ite12_46|)) (.cse12 (= |v_P1Thread1of1ForFork0_#t~mem11_46| |v_P1_#t~mem11_83|)) (.cse19 (= |v_P1_#t~ite15_86| |v_P1Thread1of1ForFork0_#t~ite15_46|)) (.cse22 (= |v_P1_#t~ite16_76| |v_P1Thread1of1ForFork0_#t~ite16_46|)) (.cse15 (= |v_P1_#t~ite14_96| |v_P1Thread1of1ForFork0_#t~ite14_46|))) (or (and .cse10 (= |v_P1_#t~ite17_66| v_~__unbuffered_p1_EAX~0_148) (= |v_P1Thread1of1ForFork0_#t~mem10_46| |v_P1_#t~mem10_59|) (or (and (or (and .cse11 .cse12 (= |v_P1_#t~ite15_86| |v_P1_#t~ite16_76|) (or (and .cse13 .cse14 .cse15 (= |v_P1_#t~ite15_86| (ite .cse8 v_~x$w_buff1~0_246 v_~x$w_buff0~0_275))) (and (= |v_P1_#t~ite14_96| |v_P1_#t~ite15_86|) .cse16 (or (and (= |v_P1_#t~mem13_97| .cse0) .cse17 (= |v_P1_#t~ite14_96| |v_P1_#t~mem13_97|)) (and .cse13 .cse8 (= |v_P1_#t~ite14_96| v_~x$w_buff0~0_275))))) (or (not .cse7) .cse16)) (and .cse13 (or (and (= |v_P1_#t~ite12_78| (ite (not .cse18) v_~x$w_buff0~0_275 v_~x$w_buff1~0_246)) .cse12 .cse17) (and (= |v_P1_#t~mem11_83| .cse0) .cse8 (= |v_P1_#t~ite12_78| |v_P1_#t~mem11_83|))) .cse14 .cse19 (= |v_P1_#t~ite12_78| |v_P1_#t~ite16_76|) .cse15 .cse7)) (= |v_P1_#t~ite17_66| |v_P1_#t~ite16_76|) .cse20) (and .cse13 .cse11 .cse21 .cse12 .cse19 (= |v_P1_#t~ite17_66| v_~x$w_buff0~0_275) .cse22 .cse15))) (and .cse13 (= |v_P1_#t~mem10_59| .cse0) .cse11 .cse12 .cse19 (= |v_P1_#t~ite17_66| |v_P1Thread1of1ForFork0_#t~ite17_45|) .cse22 .cse15 .cse23 (= v_~__unbuffered_p1_EAX~0_148 |v_P1_#t~mem10_59|)))) (= v_~x$w_buff1~0_246 v_~x$w_buff1~0_245) (= |v_P1Thread1of1ForFork0_#t~nondet6_46| v_~weak$$choice0~0_99) (= v_~x$flush_delayed~0_76 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_95 |v_~#x~0.offset_246|) (= v_~x$w_buff0~0_275 v_~x$w_buff0~0_274) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= v_~weak$$choice1~0_134 |v_P1Thread1of1ForFork0_#t~nondet9_46|) (= |v_P1Thread1of1ForFork0_#t~nondet7_46| v_~weak$$choice2~0_90) (= (ite .cse2 v_~x$w_buff1_used~0_440 (ite .cse3 v_~x$w_buff1_used~0_440 (ite .cse24 0 (ite (and .cse14 .cse20 .cse7 .cse5) v_~weak$$choice0~0_99 0)))) v_~x$w_buff1_used~0_439) (= v_~x$w_buff0_used~0_488 (ite (= (ite .cse2 .cse25 (ite .cse23 .cse25 (ite (and .cse10 .cse21) 0 (ite (and .cse10 .cse14 .cse20 .cse7) (ite (or .cse8 .cse18) 1 0) .cse26)))) 0) 0 1)) (= (ite .cse2 v_~x$r_buff0_thd2~0_222 (ite .cse3 v_~x$r_buff0_thd2~0_222 (ite .cse24 0 (ite (and .cse6 .cse20 .cse7 .cse5) v_~x$r_buff0_thd2~0_222 0)))) v_~x$r_buff0_thd2~0_221) (= v_~y~0_43 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_95 |v_~#x~0.base_246|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_275, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_46|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_46|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_46|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_46|, ~#x~0.offset=|v_~#x~0.offset_246|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_46|, ~x$w_buff1~0=v_~x$w_buff1~0_246, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_46|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_46|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_440, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_46|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_46|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_222, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_46|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_489, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_45|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, #memory_int=|v_#memory_int_470|, ~#x~0.base=|v_~#x~0.base_246|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_274, ~x$flush_delayed~0=v_~x$flush_delayed~0_76, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_96, ~x$mem_tmp~0=v_~x$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_148, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_25|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_95, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_25|, ~y~0=v_~y~0_43, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, ~#x~0.offset=|v_~#x~0.offset_246|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_95, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_230, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_439, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_221, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_488, ~weak$$choice0~0=v_~weak$$choice0~0_99, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, #memory_int=|v_#memory_int_469|, ~#x~0.base=|v_~#x~0.base_246|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_25|, ~weak$$choice2~0=v_~weak$$choice2~0_90} AuxVars[|v_P1_#t~mem11_83|, |v_P1_#t~ite21_54|, |v_P1_#t~mem13_97|, |v_P1_#t~ite12_78|, |v_P1_#t~mem20_57|, |v_P1_#t~mem10_59|, |v_P1_#t~ite14_96|, |v_P1_#t~ite17_66|, |v_P1_#t~ite15_86|, |v_P1_#t~ite16_76|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite21, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork0_#t~mem8, ~y~0, P1Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork0_#t~mem11, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet7, P1Thread1of1ForFork0_#t~nondet6, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork0_#t~ite12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~nondet9, P1Thread1of1ForFork0_#t~ite14, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite17, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0] and [824] $Ultimate##0-->L836: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd3~0_153 256) 0))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_672 256) 0))) (.cse0 (not .cse3))) (let ((.cse5 (= (mod v_~x$w_buff0_used~0_673 256) 0)) (.cse4 (and .cse1 .cse0)) (.cse2 (select |v_#memory_int_637| |v_~#x~0.base_324|))) (and (= |v_P0Thread1of1ForFork2_#in~arg#1.base_19| |v_P0Thread1of1ForFork2_~arg#1.base_19|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_587 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd3~0_152 256) 0)))) 0 v_~x$r_buff0_thd3~0_153) v_~x$r_buff1_thd3~0_152) (= v_~z~0_101 2) (= v_~x$r_buff0_thd1~0_258 v_~x$r_buff1_thd1~0_188) (= v_~x$r_buff0_thd0~0_256 v_~x$r_buff1_thd0~0_270) (or (and (= |v_P2_#t~ite26_49| |v_P2Thread1of1ForFork1_#t~ite26_38|) (= |v_P2Thread1of1ForFork1_#t~mem25_38| |v_P2_#t~mem25_52|) .cse0 (= |v_P2_#t~ite27_43| v_~x$w_buff0~0_388)) (and (= (select .cse2 |v_~#x~0.offset_324|) |v_P2_#t~mem25_52|) .cse3 (= |v_P2_#t~ite26_49| |v_P2_#t~mem25_52|) (= |v_P2_#t~ite26_49| |v_P2_#t~ite27_43|))) (= v_~x$w_buff1_used~0_587 (ite (or .cse4 (and (not .cse5) .cse0)) 0 v_~x$w_buff0_used~0_673)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_71| (ite .cse5 1 0)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_153) v_~x$r_buff0_thd3~0_152) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_19| |v_P0Thread1of1ForFork2_~arg#1.offset_19|) (= v_~x$w_buff0~0_389 v_~x$w_buff1~0_336) (= |v_#memory_int_636| (store |v_#memory_int_637| |v_~#x~0.base_324| (store .cse2 |v_~#x~0.offset_324| |v_P2_#t~ite27_43|))) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_71| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_71|) (= v_~x$r_buff0_thd2~0_309 v_~x$r_buff1_thd2~0_312) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$w_buff0~0_388 1) (= v_~x$r_buff0_thd1~0_257 1) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~y~0_65 v_~__unbuffered_p2_EAX~0_82) (= v_~x$w_buff0_used~0_672 (ite .cse0 0 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_389, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_256, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_258, ~#x~0.offset=|v_~#x~0.offset_324|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_38|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_153, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_19|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_673, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_38|, #memory_int=|v_#memory_int_637|, ~#x~0.base=|v_~#x~0.base_324|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_65} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_257, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_152, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_188, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_152, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_19|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_19|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_21|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_71|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_82, ~y~0=v_~y~0_65, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_256, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~#x~0.offset=|v_~#x~0.offset_324|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_19|, ~x$w_buff1~0=v_~x$w_buff1~0_336, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_587, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_312, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_270, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_19|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_672, #memory_int=|v_#memory_int_636|, ~#x~0.base=|v_~#x~0.base_324|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_101} AuxVars[|v_P2_#t~ite26_49|, |v_P2_#t~mem25_52|, |v_P2_#t~ite27_43|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:37:26,882 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L809: Formula: (let ((.cse25 (mod v_~x$w_buff0_used~0_489 256)) (.cse26 (mod v_~weak$$choice0~0_99 256)) (.cse3 (= (mod v_~x$w_buff0_used~0_488 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd2~0_222 256) 0))) (let ((.cse21 (not .cse20)) (.cse5 (not .cse3)) (.cse9 (= (mod v_~weak$$choice2~0_90 256) 0)) (.cse17 (= .cse26 0)) (.cse16 (= (mod v_~x$w_buff1_used~0_440 256) 0)) (.cse23 (= 0 .cse25)) (.cse1 (select |v_#memory_int_470| |v_~#x~0.base_246|))) (let ((.cse0 (select .cse1 |v_~#x~0.offset_246|)) (.cse10 (not .cse23)) (.cse14 (not .cse16)) (.cse8 (not .cse17)) (.cse18 (= (mod v_~weak$$choice1~0_134 256) 0)) (.cse2 (not .cse9)) (.cse24 (and .cse21 .cse5)) (.cse6 (not (= (mod v_~x$w_buff1_used~0_439 256) 0))) (.cse7 (= (mod v_~x$r_buff1_thd2~0_231 256) 0))) (and (= v_~x$mem_tmp~0_58 .cse0) (= v_~__unbuffered_p1_EAX$read_delayed~0_96 1) (= (store |v_#memory_int_470| |v_~#x~0.base_246| (store .cse1 |v_~#x~0.offset_246| |v_P1_#t~ite21_54|)) |v_#memory_int_469|) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$r_buff1_thd2~0_230 (ite .cse2 v_~x$r_buff1_thd2~0_231 (ite .cse3 v_~x$r_buff1_thd2~0_231 (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_221 256) 0))) (ite (and (not .cse4) .cse5) 0 (ite (and .cse4 .cse6 .cse7 .cse5) (ite .cse8 v_~x$r_buff1_thd2~0_231 0) 0)))))) (or (and .cse9 (= v_~__unbuffered_p1_EAX~0_148 |v_P1_#t~mem20_57|) (= |v_P1_#t~ite21_54| |v_P1_#t~mem20_57|)) (and .cse2 (= |v_P1_#t~ite21_54| v_~x$mem_tmp~0_58) (= |v_P1Thread1of1ForFork0_#t~mem20_46| |v_P1_#t~mem20_57|))) (let ((.cse13 (= |v_P1Thread1of1ForFork0_#t~mem13_46| |v_P1_#t~mem13_97|)) (.cse11 (= |v_P1_#t~ite12_78| |v_P1Thread1of1ForFork0_#t~ite12_46|)) (.cse12 (= |v_P1Thread1of1ForFork0_#t~mem11_46| |v_P1_#t~mem11_83|)) (.cse19 (= |v_P1_#t~ite15_86| |v_P1Thread1of1ForFork0_#t~ite15_46|)) (.cse22 (= |v_P1_#t~ite16_76| |v_P1Thread1of1ForFork0_#t~ite16_46|)) (.cse15 (= |v_P1_#t~ite14_96| |v_P1Thread1of1ForFork0_#t~ite14_46|))) (or (and .cse10 (= |v_P1_#t~ite17_66| v_~__unbuffered_p1_EAX~0_148) (= |v_P1Thread1of1ForFork0_#t~mem10_46| |v_P1_#t~mem10_59|) (or (and (or (and .cse11 .cse12 (= |v_P1_#t~ite15_86| |v_P1_#t~ite16_76|) (or (and .cse13 .cse14 .cse15 (= |v_P1_#t~ite15_86| (ite .cse8 v_~x$w_buff1~0_246 v_~x$w_buff0~0_275))) (and (= |v_P1_#t~ite14_96| |v_P1_#t~ite15_86|) .cse16 (or (and (= |v_P1_#t~mem13_97| .cse0) .cse17 (= |v_P1_#t~ite14_96| |v_P1_#t~mem13_97|)) (and .cse13 .cse8 (= |v_P1_#t~ite14_96| v_~x$w_buff0~0_275))))) (or (not .cse7) .cse16)) (and .cse13 (or (and (= |v_P1_#t~ite12_78| (ite (not .cse18) v_~x$w_buff0~0_275 v_~x$w_buff1~0_246)) .cse12 .cse17) (and (= |v_P1_#t~mem11_83| .cse0) .cse8 (= |v_P1_#t~ite12_78| |v_P1_#t~mem11_83|))) .cse14 .cse19 (= |v_P1_#t~ite12_78| |v_P1_#t~ite16_76|) .cse15 .cse7)) (= |v_P1_#t~ite17_66| |v_P1_#t~ite16_76|) .cse20) (and .cse13 .cse11 .cse21 .cse12 .cse19 (= |v_P1_#t~ite17_66| v_~x$w_buff0~0_275) .cse22 .cse15))) (and .cse13 (= |v_P1_#t~mem10_59| .cse0) .cse11 .cse12 .cse19 (= |v_P1_#t~ite17_66| |v_P1Thread1of1ForFork0_#t~ite17_45|) .cse22 .cse15 .cse23 (= v_~__unbuffered_p1_EAX~0_148 |v_P1_#t~mem10_59|)))) (= v_~x$w_buff1~0_246 v_~x$w_buff1~0_245) (= |v_P1Thread1of1ForFork0_#t~nondet6_46| v_~weak$$choice0~0_99) (= v_~x$flush_delayed~0_76 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_95 |v_~#x~0.offset_246|) (= v_~x$w_buff0~0_275 v_~x$w_buff0~0_274) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= v_~weak$$choice1~0_134 |v_P1Thread1of1ForFork0_#t~nondet9_46|) (= |v_P1Thread1of1ForFork0_#t~nondet7_46| v_~weak$$choice2~0_90) (= (ite .cse2 v_~x$w_buff1_used~0_440 (ite .cse3 v_~x$w_buff1_used~0_440 (ite .cse24 0 (ite (and .cse14 .cse20 .cse7 .cse5) v_~weak$$choice0~0_99 0)))) v_~x$w_buff1_used~0_439) (= v_~x$w_buff0_used~0_488 (ite (= (ite .cse2 .cse25 (ite .cse23 .cse25 (ite (and .cse10 .cse21) 0 (ite (and .cse10 .cse14 .cse20 .cse7) (ite (or .cse8 .cse18) 1 0) .cse26)))) 0) 0 1)) (= (ite .cse2 v_~x$r_buff0_thd2~0_222 (ite .cse3 v_~x$r_buff0_thd2~0_222 (ite .cse24 0 (ite (and .cse6 .cse20 .cse7 .cse5) v_~x$r_buff0_thd2~0_222 0)))) v_~x$r_buff0_thd2~0_221) (= v_~y~0_43 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_95 |v_~#x~0.base_246|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_275, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_46|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_46|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_46|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_46|, ~#x~0.offset=|v_~#x~0.offset_246|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_46|, ~x$w_buff1~0=v_~x$w_buff1~0_246, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_46|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_46|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_440, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_46|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_46|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_222, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_46|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_489, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_45|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, #memory_int=|v_#memory_int_470|, ~#x~0.base=|v_~#x~0.base_246|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_274, ~x$flush_delayed~0=v_~x$flush_delayed~0_76, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_96, ~x$mem_tmp~0=v_~x$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_148, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_25|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_95, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_25|, ~y~0=v_~y~0_43, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, ~#x~0.offset=|v_~#x~0.offset_246|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_95, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_230, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_439, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_221, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_488, ~weak$$choice0~0=v_~weak$$choice0~0_99, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, #memory_int=|v_#memory_int_469|, ~#x~0.base=|v_~#x~0.base_246|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_25|, ~weak$$choice2~0=v_~weak$$choice2~0_90} AuxVars[|v_P1_#t~mem11_83|, |v_P1_#t~ite21_54|, |v_P1_#t~mem13_97|, |v_P1_#t~ite12_78|, |v_P1_#t~mem20_57|, |v_P1_#t~mem10_59|, |v_P1_#t~ite14_96|, |v_P1_#t~ite17_66|, |v_P1_#t~ite15_86|, |v_P1_#t~ite16_76|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite21, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork0_#t~mem8, ~y~0, P1Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork0_#t~mem11, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet7, P1Thread1of1ForFork0_#t~nondet6, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork0_#t~ite12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~nondet9, P1Thread1of1ForFork0_#t~ite14, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite17, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0] and [825] $Ultimate##0-->L816: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd2~0_312 256) 0))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_676 256) 0))) (.cse0 (not .cse5))) (let ((.cse2 (and .cse1 .cse0)) (.cse3 (= (mod v_~x$w_buff0_used~0_677 256) 0)) (.cse4 (select |v_#memory_int_641| |v_~#x~0.base_326|))) (and (= (ite .cse0 0 1) v_~x$w_buff0_used~0_676) (= v_~y~0_67 v_~__unbuffered_p2_EAX~0_84) (= (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_311 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_589 256) 0)) .cse0)) 0 v_~x$r_buff0_thd2~0_312) v_~x$r_buff1_thd2~0_314) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_21| |v_P0Thread1of1ForFork2_~arg#1.base_21|) (= v_~x$r_buff0_thd2~0_311 (ite .cse2 0 v_~x$r_buff0_thd2~0_312)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_73| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_73|) (= v_~x$w_buff1_used~0_589 (ite (or .cse2 (and (not .cse3) .cse0)) 0 v_~x$w_buff0_used~0_677)) (= v_~x$r_buff0_thd0~0_258 v_~x$r_buff1_thd0~0_272) (= v_~z~0_103 2) (= (store |v_#memory_int_641| |v_~#x~0.base_326| (store .cse4 |v_~#x~0.offset_326| |v_P1_#t~ite24_77|)) |v_#memory_int_640|) (= v_~x$r_buff0_thd3~0_156 v_~x$r_buff1_thd3~0_154) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_73| (ite .cse3 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_73| 0)) (= v_~x$r_buff0_thd1~0_262 v_~x$r_buff1_thd1~0_190) (= v_P2Thread1of1ForFork1_~arg.offset_25 |v_P2Thread1of1ForFork1_#in~arg.offset_25|) (= v_P2Thread1of1ForFork1_~arg.base_25 |v_P2Thread1of1ForFork1_#in~arg.base_25|) (= v_~x$w_buff0~0_393 v_~x$w_buff1~0_338) (or (and .cse0 (= |v_P1_#t~ite23_83| |v_P1Thread1of1ForFork0_#t~ite23_90|) (= |v_P1Thread1of1ForFork0_#t~mem22_90| |v_P1_#t~mem22_88|) (= |v_P1_#t~ite24_77| v_~x$w_buff0~0_392)) (and .cse5 (= |v_P1_#t~ite23_83| |v_P1_#t~mem22_88|) (= |v_P1_#t~mem22_88| (select .cse4 |v_~#x~0.offset_326|)) (= |v_P1_#t~ite23_83| |v_P1_#t~ite24_77|))) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_21| |v_P0Thread1of1ForFork2_~arg#1.offset_21|) (= v_~x$w_buff0~0_392 1) (= v_~x$r_buff0_thd1~0_261 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_393, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_90|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_262, ~#x~0.offset=|v_~#x~0.offset_326|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_156, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_90|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_312, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_677, #memory_int=|v_#memory_int_641|, ~#x~0.base=|v_~#x~0.base_326|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~y~0=v_~y~0_67} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_261, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_47|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_154, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_190, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_156, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_21|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_21|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_73|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_84, ~y~0=v_~y~0_67, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_258, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_25, ~#x~0.offset=|v_~#x~0.offset_326|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_21|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_589, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_311, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_272, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_676, #memory_int=|v_#memory_int_640|, ~#x~0.base=|v_~#x~0.base_326|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_25|, ~z~0=v_~z~0_103} AuxVars[|v_P1_#t~ite24_77|, |v_P1_#t~ite23_83|, |v_P1_#t~mem22_88|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-06 06:37:29,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [811] $Ultimate##0-->L809: Formula: (let ((.cse25 (mod v_~x$w_buff0_used~0_489 256)) (.cse26 (mod v_~weak$$choice0~0_99 256)) (.cse3 (= (mod v_~x$w_buff0_used~0_488 256) 0)) (.cse20 (= (mod v_~x$r_buff0_thd2~0_222 256) 0))) (let ((.cse21 (not .cse20)) (.cse5 (not .cse3)) (.cse9 (= (mod v_~weak$$choice2~0_90 256) 0)) (.cse17 (= .cse26 0)) (.cse16 (= (mod v_~x$w_buff1_used~0_440 256) 0)) (.cse23 (= 0 .cse25)) (.cse1 (select |v_#memory_int_470| |v_~#x~0.base_246|))) (let ((.cse0 (select .cse1 |v_~#x~0.offset_246|)) (.cse10 (not .cse23)) (.cse14 (not .cse16)) (.cse8 (not .cse17)) (.cse18 (= (mod v_~weak$$choice1~0_134 256) 0)) (.cse2 (not .cse9)) (.cse24 (and .cse21 .cse5)) (.cse6 (not (= (mod v_~x$w_buff1_used~0_439 256) 0))) (.cse7 (= (mod v_~x$r_buff1_thd2~0_231 256) 0))) (and (= v_~x$mem_tmp~0_58 .cse0) (= v_~__unbuffered_p1_EAX$read_delayed~0_96 1) (= (store |v_#memory_int_470| |v_~#x~0.base_246| (store .cse1 |v_~#x~0.offset_246| |v_P1_#t~ite21_54|)) |v_#memory_int_469|) (= v_P1Thread1of1ForFork0_~arg.base_21 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$r_buff1_thd2~0_230 (ite .cse2 v_~x$r_buff1_thd2~0_231 (ite .cse3 v_~x$r_buff1_thd2~0_231 (let ((.cse4 (= (mod v_~x$r_buff0_thd2~0_221 256) 0))) (ite (and (not .cse4) .cse5) 0 (ite (and .cse4 .cse6 .cse7 .cse5) (ite .cse8 v_~x$r_buff1_thd2~0_231 0) 0)))))) (or (and .cse9 (= v_~__unbuffered_p1_EAX~0_148 |v_P1_#t~mem20_57|) (= |v_P1_#t~ite21_54| |v_P1_#t~mem20_57|)) (and .cse2 (= |v_P1_#t~ite21_54| v_~x$mem_tmp~0_58) (= |v_P1Thread1of1ForFork0_#t~mem20_46| |v_P1_#t~mem20_57|))) (let ((.cse13 (= |v_P1Thread1of1ForFork0_#t~mem13_46| |v_P1_#t~mem13_97|)) (.cse11 (= |v_P1_#t~ite12_78| |v_P1Thread1of1ForFork0_#t~ite12_46|)) (.cse12 (= |v_P1Thread1of1ForFork0_#t~mem11_46| |v_P1_#t~mem11_83|)) (.cse19 (= |v_P1_#t~ite15_86| |v_P1Thread1of1ForFork0_#t~ite15_46|)) (.cse22 (= |v_P1_#t~ite16_76| |v_P1Thread1of1ForFork0_#t~ite16_46|)) (.cse15 (= |v_P1_#t~ite14_96| |v_P1Thread1of1ForFork0_#t~ite14_46|))) (or (and .cse10 (= |v_P1_#t~ite17_66| v_~__unbuffered_p1_EAX~0_148) (= |v_P1Thread1of1ForFork0_#t~mem10_46| |v_P1_#t~mem10_59|) (or (and (or (and .cse11 .cse12 (= |v_P1_#t~ite15_86| |v_P1_#t~ite16_76|) (or (and .cse13 .cse14 .cse15 (= |v_P1_#t~ite15_86| (ite .cse8 v_~x$w_buff1~0_246 v_~x$w_buff0~0_275))) (and (= |v_P1_#t~ite14_96| |v_P1_#t~ite15_86|) .cse16 (or (and (= |v_P1_#t~mem13_97| .cse0) .cse17 (= |v_P1_#t~ite14_96| |v_P1_#t~mem13_97|)) (and .cse13 .cse8 (= |v_P1_#t~ite14_96| v_~x$w_buff0~0_275))))) (or (not .cse7) .cse16)) (and .cse13 (or (and (= |v_P1_#t~ite12_78| (ite (not .cse18) v_~x$w_buff0~0_275 v_~x$w_buff1~0_246)) .cse12 .cse17) (and (= |v_P1_#t~mem11_83| .cse0) .cse8 (= |v_P1_#t~ite12_78| |v_P1_#t~mem11_83|))) .cse14 .cse19 (= |v_P1_#t~ite12_78| |v_P1_#t~ite16_76|) .cse15 .cse7)) (= |v_P1_#t~ite17_66| |v_P1_#t~ite16_76|) .cse20) (and .cse13 .cse11 .cse21 .cse12 .cse19 (= |v_P1_#t~ite17_66| v_~x$w_buff0~0_275) .cse22 .cse15))) (and .cse13 (= |v_P1_#t~mem10_59| .cse0) .cse11 .cse12 .cse19 (= |v_P1_#t~ite17_66| |v_P1Thread1of1ForFork0_#t~ite17_45|) .cse22 .cse15 .cse23 (= v_~__unbuffered_p1_EAX~0_148 |v_P1_#t~mem10_59|)))) (= v_~x$w_buff1~0_246 v_~x$w_buff1~0_245) (= |v_P1Thread1of1ForFork0_#t~nondet6_46| v_~weak$$choice0~0_99) (= v_~x$flush_delayed~0_76 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_95 |v_~#x~0.offset_246|) (= v_~x$w_buff0~0_275 v_~x$w_buff0~0_274) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_21) (= v_~weak$$choice1~0_134 |v_P1Thread1of1ForFork0_#t~nondet9_46|) (= |v_P1Thread1of1ForFork0_#t~nondet7_46| v_~weak$$choice2~0_90) (= (ite .cse2 v_~x$w_buff1_used~0_440 (ite .cse3 v_~x$w_buff1_used~0_440 (ite .cse24 0 (ite (and .cse14 .cse20 .cse7 .cse5) v_~weak$$choice0~0_99 0)))) v_~x$w_buff1_used~0_439) (= v_~x$w_buff0_used~0_488 (ite (= (ite .cse2 .cse25 (ite .cse23 .cse25 (ite (and .cse10 .cse21) 0 (ite (and .cse10 .cse14 .cse20 .cse7) (ite (or .cse8 .cse18) 1 0) .cse26)))) 0) 0 1)) (= (ite .cse2 v_~x$r_buff0_thd2~0_222 (ite .cse3 v_~x$r_buff0_thd2~0_222 (ite .cse24 0 (ite (and .cse6 .cse20 .cse7 .cse5) v_~x$r_buff0_thd2~0_222 0)))) v_~x$r_buff0_thd2~0_221) (= v_~y~0_43 1) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_95 |v_~#x~0.base_246|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_275, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_46|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_46|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_46|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_46|, ~#x~0.offset=|v_~#x~0.offset_246|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_46|, ~x$w_buff1~0=v_~x$w_buff1~0_246, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_46|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_46|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_440, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_46|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_46|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_222, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_46|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_46|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_489, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_45|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, #memory_int=|v_#memory_int_470|, ~#x~0.base=|v_~#x~0.base_246|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_274, ~x$flush_delayed~0=v_~x$flush_delayed~0_76, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_96, ~x$mem_tmp~0=v_~x$mem_tmp~0_58, ~weak$$choice1~0=v_~weak$$choice1~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_148, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_25|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_95, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_25|, ~y~0=v_~y~0_43, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_21, ~#x~0.offset=|v_~#x~0.offset_246|, ~x$w_buff1~0=v_~x$w_buff1~0_245, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_95, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_230, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_439, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_221, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_488, ~weak$$choice0~0=v_~weak$$choice0~0_99, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_21, #memory_int=|v_#memory_int_469|, ~#x~0.base=|v_~#x~0.base_246|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_25|, ~weak$$choice2~0=v_~weak$$choice2~0_90} AuxVars[|v_P1_#t~mem11_83|, |v_P1_#t~ite21_54|, |v_P1_#t~mem13_97|, |v_P1_#t~ite12_78|, |v_P1_#t~mem20_57|, |v_P1_#t~mem10_59|, |v_P1_#t~ite14_96|, |v_P1_#t~ite17_66|, |v_P1_#t~ite15_86|, |v_P1_#t~ite16_76|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem20, ~x$flush_delayed~0, ~__unbuffered_p1_EAX$read_delayed~0, ~x$mem_tmp~0, ~weak$$choice1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite21, ~__unbuffered_p1_EAX$read_delayed_var~0.base, P1Thread1of1ForFork0_#t~mem8, ~y~0, P1Thread1of1ForFork0_#t~mem10, P1Thread1of1ForFork0_#t~mem11, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0_#t~nondet7, P1Thread1of1ForFork0_#t~nondet6, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~mem13, P1Thread1of1ForFork0_#t~ite12, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~nondet9, P1Thread1of1ForFork0_#t~ite14, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite15, P1Thread1of1ForFork0_#t~ite18, ~x$w_buff0_used~0, P1Thread1of1ForFork0_#t~ite17, ~weak$$choice0~0, P1Thread1of1ForFork0_~arg.offset, #memory_int, P1Thread1of1ForFork0_#t~mem19, ~weak$$choice2~0] and [826] $Ultimate##0-->L780: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_681 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd1~0_266 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_680 256) 0)))) (and (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_75| 0)) (= v_~x$r_buff0_thd1~0_265 (ite .cse0 0 1)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_75| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_75|) (= v_~x$r_buff0_thd3~0_158 v_~x$r_buff1_thd3~0_156) (= (ite .cse1 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_75|) (= (store |v_#memory_int_645| |v_~#x~0.base_328| (store (select |v_#memory_int_645| |v_~#x~0.base_328|) |v_~#x~0.offset_328| v_~x$w_buff0~0_396)) |v_#memory_int_644|) (= v_~x$w_buff0_used~0_680 0) (= v_~x$r_buff0_thd2~0_315 v_~x$r_buff1_thd2~0_316) (= v_~x$w_buff0~0_396 1) (= v_~x$w_buff1_used~0_591 (ite (or .cse0 (and .cse2 (not .cse1))) 0 v_~x$w_buff0_used~0_681)) (= v_~z~0_105 2) (= v_~x$w_buff0~0_397 v_~x$w_buff1~0_340) (= v_~x$r_buff1_thd1~0_192 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_591 256) 0)) .cse2) (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_265 256) 0)))) 0 v_~x$r_buff0_thd1~0_266)) (= v_~y~0_69 v_~__unbuffered_p2_EAX~0_86) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_23| |v_P0Thread1of1ForFork2_~arg#1.base_23|) (= v_~x$r_buff0_thd0~0_260 v_~x$r_buff1_thd0~0_274) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_23| |v_P0Thread1of1ForFork2_~arg#1.offset_23|) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_397, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_260, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_266, ~#x~0.offset=|v_~#x~0.offset_328|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_23|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_23|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_681, #memory_int=|v_#memory_int_645|, ~#x~0.base=|v_~#x~0.base_328|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~y~0=v_~y~0_69} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_396, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_265, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_75|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_156, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_192, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_23|, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_71|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_23|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_75|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~y~0=v_~y~0_69, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_260, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, ~#x~0.offset=|v_~#x~0.offset_328|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_23|, ~x$w_buff1~0=v_~x$w_buff1~0_340, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_591, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_316, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_315, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_680, #memory_int=|v_#memory_int_644|, ~#x~0.base=|v_~#x~0.base_328|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_105, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_38|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p2_EAX~0, ~z~0, P0Thread1of1ForFork2_#t~ite5#1] [2022-12-06 06:37:32,783 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:37:32,784 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9519 [2022-12-06 06:37:32,784 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 223 flow [2022-12-06 06:37:32,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:37:32,784 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:37:32,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:32,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:37:32,785 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:37:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:37:32,785 INFO L85 PathProgramCache]: Analyzing trace with hash -337903908, now seen corresponding path program 1 times [2022-12-06 06:37:32,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:37:32,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077018212] [2022-12-06 06:37:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:37:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:37:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:37:32,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:37:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:37:33,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:37:33,025 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:37:33,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:37:33,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:37:33,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:37:33,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:37:33,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:37:33,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:37:33,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:37:33,030 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:37:33,035 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:37:33,036 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:37:33,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:37:33 BasicIcfg [2022-12-06 06:37:33,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:37:33,137 INFO L158 Benchmark]: Toolchain (without parser) took 43428.85ms. Allocated memory was 183.5MB in the beginning and 625.0MB in the end (delta: 441.5MB). Free memory was 157.8MB in the beginning and 225.1MB in the end (delta: -67.3MB). Peak memory consumption was 374.6MB. Max. memory is 8.0GB. [2022-12-06 06:37:33,138 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:37:33,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.51ms. Allocated memory is still 183.5MB. Free memory was 157.4MB in the beginning and 130.0MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:37:33,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.77ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 127.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:33,138 INFO L158 Benchmark]: Boogie Preprocessor took 57.26ms. Allocated memory is still 183.5MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:37:33,138 INFO L158 Benchmark]: RCFGBuilder took 1046.13ms. Allocated memory is still 183.5MB. Free memory was 124.9MB in the beginning and 144.2MB in the end (delta: -19.4MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. [2022-12-06 06:37:33,139 INFO L158 Benchmark]: TraceAbstraction took 41752.99ms. Allocated memory was 183.5MB in the beginning and 625.0MB in the end (delta: 441.5MB). Free memory was 143.2MB in the beginning and 225.1MB in the end (delta: -81.9MB). Peak memory consumption was 359.6MB. Max. memory is 8.0GB. [2022-12-06 06:37:33,140 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.13ms. Allocated memory is still 127.9MB. Free memory is still 104.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.51ms. Allocated memory is still 183.5MB. Free memory was 157.4MB in the beginning and 130.0MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.77ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 127.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.26ms. Allocated memory is still 183.5MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1046.13ms. Allocated memory is still 183.5MB. Free memory was 124.9MB in the beginning and 144.2MB in the end (delta: -19.4MB). Peak memory consumption was 26.6MB. Max. memory is 8.0GB. * TraceAbstraction took 41752.99ms. Allocated memory was 183.5MB in the beginning and 625.0MB in the end (delta: 441.5MB). Free memory was 143.2MB in the beginning and 225.1MB in the end (delta: -81.9MB). Peak memory consumption was 359.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.6s, 132 PlacesBefore, 37 PlacesAfterwards, 124 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1659, independent: 1600, independent conditional: 1600, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1659, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1659, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1659, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1250, independent: 1212, independent conditional: 0, independent unconditional: 1212, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1250, independent: 1200, independent conditional: 0, independent unconditional: 1200, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 450, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 431, dependent conditional: 0, dependent unconditional: 431, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1659, independent: 388, independent conditional: 0, independent unconditional: 388, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1250, unknown conditional: 0, unknown unconditional: 1250] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 1992, Positive conditional cache size: 0, Positive unconditional cache size: 1992, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, 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.2s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 63, independent conditional: 63, 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: 85, independent: 63, independent conditional: 8, independent unconditional: 55, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 63, independent conditional: 8, independent unconditional: 55, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, independent: 63, independent conditional: 8, independent unconditional: 55, dependent: 22, dependent conditional: 5, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74, independent: 57, independent conditional: 8, independent unconditional: 49, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 179, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 174, dependent conditional: 60, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 74, unknown conditional: 12, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 57, Positive conditional cache size: 8, Positive unconditional cache size: 49, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 3, independent unconditional: 57, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 65, Positive conditional cache size: 8, Positive unconditional cache size: 57, Negative cache size: 21, Negative conditional cache size: 4, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 59, independent conditional: 3, independent unconditional: 56, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 78, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 65, Positive conditional cache size: 8, Positive unconditional cache size: 57, Negative cache size: 21, Negative conditional cache size: 4, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 67, independent conditional: 9, independent unconditional: 58, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 76, Positive conditional cache size: 8, Positive unconditional cache size: 68, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 37 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 94, independent conditional: 32, independent unconditional: 62, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 89, Positive conditional cache size: 8, Positive unconditional cache size: 81, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 38 PlacesBefore, 37 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 81, independent: 73, independent conditional: 55, independent unconditional: 18, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, independent: 73, independent conditional: 41, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 73, independent conditional: 41, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 16, 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: 19, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 159, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 54, independent conditional: 25, independent unconditional: 29, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 19, unknown conditional: 16, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 122, Positive conditional cache size: 24, Positive unconditional cache size: 98, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, 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, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 83, independent: 69, independent conditional: 37, independent unconditional: 32, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 69, independent conditional: 18, independent unconditional: 51, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 69, independent conditional: 18, independent unconditional: 51, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, 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: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 64, independent conditional: 16, independent unconditional: 48, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 129, Positive conditional cache size: 26, Positive unconditional cache size: 103, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 44 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 107, independent conditional: 59, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 107, independent conditional: 59, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 107, independent conditional: 59, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 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: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 123, independent: 103, independent conditional: 55, independent unconditional: 48, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 144, Positive conditional cache size: 30, Positive unconditional cache size: 114, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 63, independent conditional: 26, independent unconditional: 37, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 63, independent conditional: 26, independent unconditional: 37, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 63, independent conditional: 26, independent unconditional: 37, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 59, independent conditional: 25, independent unconditional: 34, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 148, Positive conditional cache size: 31, Positive unconditional cache size: 117, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 148, Positive conditional cache size: 31, Positive unconditional cache size: 117, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, 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: 1.4s, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 3, independent unconditional: 7, 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: 10, independent: 10, independent conditional: 2, independent unconditional: 8, 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: 10, independent: 10, independent conditional: 2, independent unconditional: 8, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 154, Positive conditional cache size: 31, Positive unconditional cache size: 123, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 46 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 10, independent: 10, independent conditional: 6, independent unconditional: 4, 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: 3, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 162, Positive conditional cache size: 33, Positive unconditional cache size: 129, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L753] 0 int z = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1964; [L854] FCALL, FORK 0 pthread_create(&t1964, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1964, ((void *)0), P0, ((void *)0))=-3, t1964={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t1965; [L856] FCALL, FORK 0 pthread_create(&t1965, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1965, ((void *)0), P1, ((void *)0))=-2, t1964={7:0}, t1965={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t1966; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 [L808] 2 y = 1 [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L858] FCALL, FORK 0 pthread_create(&t1966, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1966, ((void *)0), P2, ((void *)0))=-1, t1964={7:0}, t1965={5:0}, t1966={6:0}, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L825] 3 __unbuffered_p2_EAX = y [L828] 3 z = 1 [L760] 3 z = 2 [L763] 3 x$w_buff1 = x$w_buff0 [L764] 3 x$w_buff0 = 1 [L765] 3 x$w_buff1_used = x$w_buff0_used [L766] 3 x$w_buff0_used = (_Bool)1 [L767] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L767] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 3 x$r_buff0_thd1 = (_Bool)1 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 858]: 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, 154 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 3 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=11, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:37:33,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...