/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:23:54,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:23:54,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:23:54,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:23:54,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:23:54,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:23:54,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:23:54,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:23:54,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:23:54,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:23:54,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:23:54,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:23:54,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:23:54,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:23:54,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:23:54,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:23:54,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:23:54,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:23:54,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:23:54,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:23:54,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:23:54,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:23:54,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:23:54,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:23:54,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:23:54,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:23:54,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:23:54,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:23:54,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:23:54,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:23:54,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:23:54,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:23:54,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:23:54,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:23:54,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:23:54,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:23:54,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:23:54,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:23:54,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:23:54,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:23:54,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:23:54,138 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:23:54,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:23:54,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:23:54,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:23:54,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:23:54,163 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:23:54,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:23:54,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:23:54,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:23:54,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:23:54,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:23:54,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:23:54,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:23:54,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:23:54,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:23:54,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:23:54,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:23:54,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:23:54,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:23:54,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:23:54,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:23:54,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:23:54,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:23:54,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:23:54,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:23:54,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:23:54,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:23:54,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:23:54,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:23:54,167 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 04:23:54,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:23:54,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:23:54,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:23:54,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:23:54,450 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:23:54,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2022-12-06 04:23:55,508 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:23:55,728 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:23:55,728 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2022-12-06 04:23:55,741 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc2d8a0c/b8cde1d8078647bdb0ac3b27073e8c34/FLAG92ee164ed [2022-12-06 04:23:55,755 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fc2d8a0c/b8cde1d8078647bdb0ac3b27073e8c34 [2022-12-06 04:23:55,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:23:55,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:23:55,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:23:55,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:23:55,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:23:55,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:23:55" (1/1) ... [2022-12-06 04:23:55,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d0c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:55, skipping insertion in model container [2022-12-06 04:23:55,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:23:55" (1/1) ... [2022-12-06 04:23:55,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:23:55,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:23:55,905 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/safe000_power.opt.i[951,964] [2022-12-06 04:23:56,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:23:56,109 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:23:56,118 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/safe000_power.opt.i[951,964] [2022-12-06 04:23:56,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:23:56,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:23:56,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:23:56,236 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:23:56,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56 WrapperNode [2022-12-06 04:23:56,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:23:56,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:23:56,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:23:56,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:23:56,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,307 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-12-06 04:23:56,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:23:56,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:23:56,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:23:56,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:23:56,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:23:56,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:23:56,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:23:56,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:23:56,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (1/1) ... [2022-12-06 04:23:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:23:56,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:23:56,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:23:56,393 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 04:23:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:23:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:23:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:23:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:23:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:23:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:23:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:23:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:23:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:23:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:23:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:23:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:23:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:23:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:23:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:23:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:23:56,424 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 04:23:56,599 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:23:56,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:23:57,003 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:23:57,236 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:23:57,236 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:23:57,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:23:57 BoogieIcfgContainer [2022-12-06 04:23:57,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:23:57,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:23:57,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:23:57,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:23:57,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:23:55" (1/3) ... [2022-12-06 04:23:57,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29be292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:23:57, skipping insertion in model container [2022-12-06 04:23:57,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:23:56" (2/3) ... [2022-12-06 04:23:57,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29be292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:23:57, skipping insertion in model container [2022-12-06 04:23:57,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:23:57" (3/3) ... [2022-12-06 04:23:57,246 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-12-06 04:23:57,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:23:57,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:23:57,279 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:23:57,366 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:23:57,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 04:23:57,452 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:23:57,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:57,456 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 04:23:57,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-06 04:23:57,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-06 04:23:57,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:23:57,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 04:23:57,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-06 04:23:57,529 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 04:23:57,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:23:57,530 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 04:23:57,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-06 04:23:57,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-06 04:24:06,881 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 04:24:06,894 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:24:06,899 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;@74ce90af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:24:06,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:24:06,901 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 04:24:06,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:06,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:06,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:24:06,902 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 04:24:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash 25498314, now seen corresponding path program 1 times [2022-12-06 04:24:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304638915] [2022-12-06 04:24:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:07,188 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 04:24:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:07,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304638915] [2022-12-06 04:24:07,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304638915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:07,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:07,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741631888] [2022-12-06 04:24:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:07,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:07,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:07,210 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:24:07,211 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 04:24:07,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:07,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:24:07,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:07,578 INFO L130 PetriNetUnfolder]: 1130/1694 cut-off events. [2022-12-06 04:24:07,578 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 04:24:07,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1694 events. 1130/1694 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8475 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 04:24:07,586 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 30 selfloop transitions, 2 changer transitions 8/42 dead transitions. [2022-12-06 04:24:07,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2022-12-06 04:24:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 04:24:07,595 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:24:07,596 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 51 transitions. [2022-12-06 04:24:07,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2022-12-06 04:24:07,598 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 04:24:07,600 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 52 flow [2022-12-06 04:24:07,601 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 04:24:07,603 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-06 04:24:07,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:07,604 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 52 flow [2022-12-06 04:24:07,606 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:07,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:07,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 52 flow [2022-12-06 04:24:07,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:24:07,612 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:24:07,612 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:07,612 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 3. Compared 26 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 04:24:07,612 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:24:07,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:24:07,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:07,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 04:24:07,736 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:24:07,737 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 04:24:07,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:07,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:07,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:24:07,740 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 04:24:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1695451318, now seen corresponding path program 1 times [2022-12-06 04:24:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:07,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541901384] [2022-12-06 04:24:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:24:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:08,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541901384] [2022-12-06 04:24:08,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541901384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:08,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:08,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272970806] [2022-12-06 04:24:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:08,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:08,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:08,027 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:24:08,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 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 04:24:08,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:08,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:24:08,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:08,249 INFO L130 PetriNetUnfolder]: 676/1091 cut-off events. [2022-12-06 04:24:08,250 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-06 04:24:08,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 1091 events. 676/1091 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4931 event pairs, 184 based on Foata normal form. 20/1106 useless extension candidates. Maximal degree in co-relation 2234. Up to 773 conditions per place. [2022-12-06 04:24:08,255 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:24:08,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 128 flow [2022-12-06 04:24:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:24:08,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:24:08,257 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:24:08,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 128 flow [2022-12-06 04:24:08,257 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 04:24:08,258 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 04:24:08,258 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 04:24:08,258 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2022-12-06 04:24:08,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:08,259 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:24:08,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:08,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:08,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:24:08,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:24:08,263 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:24:08,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:24:08,264 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 3. Compared 26 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 04:24:08,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:24:08,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 04:24:08,298 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:08,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:24:08,299 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-06 04:24:08,299 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 04:24:08,300 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:08,300 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:24:08,300 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 04:24:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1019383512, now seen corresponding path program 1 times [2022-12-06 04:24:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073721674] [2022-12-06 04:24:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:08,432 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 04:24:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:08,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073721674] [2022-12-06 04:24:08,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073721674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:08,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:08,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:08,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416898820] [2022-12-06 04:24:08,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:08,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:24:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:08,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:24:08,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:24:08,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:24:08,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 04:24:08,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:08,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:24:08,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:08,840 INFO L130 PetriNetUnfolder]: 1579/2390 cut-off events. [2022-12-06 04:24:08,841 INFO L131 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2022-12-06 04:24:08,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2390 events. 1579/2390 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11013 event pairs, 153 based on Foata normal form. 145/2535 useless extension candidates. Maximal degree in co-relation 5046. Up to 729 conditions per place. [2022-12-06 04:24:08,847 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 42 selfloop transitions, 5 changer transitions 17/64 dead transitions. [2022-12-06 04:24:08,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 277 flow [2022-12-06 04:24:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:24:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:24:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 04:24:08,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2022-12-06 04:24:08,849 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 6 states and 67 transitions. [2022-12-06 04:24:08,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 277 flow [2022-12-06 04:24:08,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 64 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:08,850 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 90 flow [2022-12-06 04:24:08,851 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-06 04:24:08,851 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 04:24:08,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:08,851 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 90 flow [2022-12-06 04:24:08,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:08,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:08,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 90 flow [2022-12-06 04:24:08,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 90 flow [2022-12-06 04:24:08,857 INFO L130 PetriNetUnfolder]: 1/23 cut-off events. [2022-12-06 04:24:08,857 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:24:08,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 23 events. 1/23 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 43. Up to 5 conditions per place. [2022-12-06 04:24:08,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 90 flow [2022-12-06 04:24:08,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:24:08,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:08,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:24:08,912 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 93 flow [2022-12-06 04:24:08,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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 04:24:08,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:08,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:08,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:24:08,912 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 04:24:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 849602173, now seen corresponding path program 1 times [2022-12-06 04:24:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:08,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900675107] [2022-12-06 04:24:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:08,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:09,050 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 04:24:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:09,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900675107] [2022-12-06 04:24:09,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900675107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:09,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:09,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:24:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670792955] [2022-12-06 04:24:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:09,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:09,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:24:09,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:24:09,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:09,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:24:09,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:09,204 INFO L130 PetriNetUnfolder]: 632/972 cut-off events. [2022-12-06 04:24:09,204 INFO L131 PetriNetUnfolder]: For 867/867 co-relation queries the response was YES. [2022-12-06 04:24:09,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 972 events. 632/972 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4103 event pairs, 230 based on Foata normal form. 12/938 useless extension candidates. Maximal degree in co-relation 2546. Up to 841 conditions per place. [2022-12-06 04:24:09,210 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 32 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-06 04:24:09,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 202 flow [2022-12-06 04:24:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 04:24:09,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 04:24:09,211 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 93 flow. Second operand 3 states and 40 transitions. [2022-12-06 04:24:09,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 202 flow [2022-12-06 04:24:09,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 188 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:09,214 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 91 flow [2022-12-06 04:24:09,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-06 04:24:09,214 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-06 04:24:09,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:09,214 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 91 flow [2022-12-06 04:24:09,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:09,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:09,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 91 flow [2022-12-06 04:24:09,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 91 flow [2022-12-06 04:24:09,220 INFO L130 PetriNetUnfolder]: 1/23 cut-off events. [2022-12-06 04:24:09,220 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:24:09,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 23 events. 1/23 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2022-12-06 04:24:09,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 91 flow [2022-12-06 04:24:09,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:24:09,240 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:24:09,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 04:24:09,245 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 91 flow [2022-12-06 04:24:09,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 04:24:09,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:09,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:09,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:24:09,246 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 04:24:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash 488831795, now seen corresponding path program 1 times [2022-12-06 04:24:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:09,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122577445] [2022-12-06 04:24:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:10,125 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 04:24:10,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:10,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122577445] [2022-12-06 04:24:10,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122577445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:10,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:10,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675682814] [2022-12-06 04:24:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:10,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:10,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:10,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:24:10,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 04:24:10,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:10,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:24:10,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:10,350 INFO L130 PetriNetUnfolder]: 654/1027 cut-off events. [2022-12-06 04:24:10,350 INFO L131 PetriNetUnfolder]: For 733/733 co-relation queries the response was YES. [2022-12-06 04:24:10,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1027 events. 654/1027 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4135 event pairs, 267 based on Foata normal form. 4/1031 useless extension candidates. Maximal degree in co-relation 2739. Up to 897 conditions per place. [2022-12-06 04:24:10,355 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 40 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2022-12-06 04:24:10,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 277 flow [2022-12-06 04:24:10,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-06 04:24:10,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-06 04:24:10,357 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 91 flow. Second operand 5 states and 60 transitions. [2022-12-06 04:24:10,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 277 flow [2022-12-06 04:24:10,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 256 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:24:10,360 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 141 flow [2022-12-06 04:24:10,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-06 04:24:10,360 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2022-12-06 04:24:10,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:10,361 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 141 flow [2022-12-06 04:24:10,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:10,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:10,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 141 flow [2022-12-06 04:24:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 141 flow [2022-12-06 04:24:10,371 INFO L130 PetriNetUnfolder]: 14/64 cut-off events. [2022-12-06 04:24:10,371 INFO L131 PetriNetUnfolder]: For 80/84 co-relation queries the response was YES. [2022-12-06 04:24:10,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 64 events. 14/64 cut-off events. For 80/84 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 245 event pairs, 4 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 157. Up to 20 conditions per place. [2022-12-06 04:24:10,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 141 flow [2022-12-06 04:24:10,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 276 [2022-12-06 04:24:10,440 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 04:24:11,149 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 04:24:11,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [704] $Ultimate##0-->L806: Formula: (let ((.cse24 (mod v_~x$w_buff0_used~0_269 256)) (.cse25 (mod v_~weak$$choice0~0_73 256)) (.cse19 (= (mod v_~x$w_buff0_used~0_268 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd2~0_124 256) 0))) (let ((.cse23 (select |v_#memory_int_234| |v_~#x~0.base_154|)) (.cse15 (not .cse14)) (.cse21 (not .cse19)) (.cse0 (= (mod v_~weak$$choice2~0_54 256) 0)) (.cse13 (= (mod v_~x$w_buff1_used~0_238 256) 0)) (.cse5 (= .cse25 0)) (.cse18 (= .cse24 0))) (let ((.cse17 (not .cse18)) (.cse7 (= (mod v_~weak$$choice1~0_72 256) 0)) (.cse3 (not .cse5)) (.cse11 (not .cse13)) (.cse1 (not .cse0)) (.cse26 (and .cse15 .cse21)) (.cse22 (not (= (mod v_~x$w_buff1_used~0_237 256) 0))) (.cse9 (= (mod v_~x$r_buff1_thd2~0_120 256) 0)) (.cse4 (select .cse23 |v_~#x~0.offset_154|))) (and (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_42 |v_~#x~0.offset_154|) (or (and (= |v_P1_#t~ite21_32| |v_P1_#t~mem20_35|) (= |v_P1_#t~mem20_35| v_~__unbuffered_p1_EAX~0_59) .cse0) (and (= |v_P1_#t~ite21_32| v_~x$mem_tmp~0_24) (= |v_P1Thread1of1ForFork0_#t~mem20_6| |v_P1_#t~mem20_35|) .cse1)) (let ((.cse12 (= |v_P1_#t~ite12_56| |v_P1Thread1of1ForFork0_#t~ite12_6|)) (.cse2 (= |v_P1Thread1of1ForFork0_#t~mem13_6| |v_P1_#t~mem13_75|)) (.cse16 (= |v_P1_#t~ite16_54| |v_P1Thread1of1ForFork0_#t~ite16_6|)) (.cse8 (= |v_P1_#t~ite15_64| |v_P1Thread1of1ForFork0_#t~ite15_6|)) (.cse6 (= |v_P1Thread1of1ForFork0_#t~mem11_6| |v_P1_#t~mem11_61|)) (.cse10 (= |v_P1_#t~ite14_74| |v_P1Thread1of1ForFork0_#t~ite14_6|))) (or (and (or (and (or (and .cse2 (or (and (= |v_P1_#t~ite12_56| |v_P1_#t~mem11_61|) .cse3 (= |v_P1_#t~mem11_61| .cse4)) (and .cse5 .cse6 (= |v_P1_#t~ite12_56| (ite (not .cse7) v_~x$w_buff0~0_133 v_~x$w_buff1~0_118)))) (= |v_P1_#t~ite12_56| |v_P1_#t~ite16_54|) .cse8 .cse9 .cse10 .cse11) (and .cse12 (or (and .cse2 (= (ite .cse3 v_~x$w_buff1~0_118 v_~x$w_buff0~0_133) |v_P1_#t~ite15_64|) .cse10 .cse11) (and .cse13 (or (and (= |v_P1_#t~ite14_74| v_~x$w_buff0~0_133) .cse2 .cse3) (and (= |v_P1_#t~ite14_74| |v_P1_#t~mem13_75|) (= |v_P1_#t~mem13_75| .cse4) .cse5)) (= |v_P1_#t~ite14_74| |v_P1_#t~ite15_64|))) .cse6 (= |v_P1_#t~ite15_64| |v_P1_#t~ite16_54|) (or .cse13 (not .cse9)))) .cse14 (= |v_P1_#t~ite17_44| |v_P1_#t~ite16_54|)) (and .cse12 .cse2 .cse15 .cse16 .cse8 .cse6 (= |v_P1_#t~ite17_44| v_~x$w_buff0~0_133) .cse10)) (= |v_P1_#t~ite17_44| v_~__unbuffered_p1_EAX~0_59) .cse17 (= |v_P1Thread1of1ForFork0_#t~mem10_6| |v_P1_#t~mem10_37|)) (and .cse12 .cse2 .cse16 .cse18 .cse8 (= |v_P1_#t~mem10_37| .cse4) .cse6 (= |v_P1_#t~ite17_44| |v_P1Thread1of1ForFork0_#t~ite17_6|) (= |v_P1_#t~mem10_37| v_~__unbuffered_p1_EAX~0_59) .cse10))) (= v_~weak$$choice1~0_72 |v_P1Thread1of1ForFork0_#t~nondet9_6|) (= v_~x$r_buff1_thd2~0_119 (ite .cse1 v_~x$r_buff1_thd2~0_120 (ite .cse19 v_~x$r_buff1_thd2~0_120 (let ((.cse20 (= (mod v_~x$r_buff0_thd2~0_123 256) 0))) (ite (and (not .cse20) .cse21) 0 (ite (and .cse20 .cse21 .cse22 .cse9) (ite .cse3 v_~x$r_buff1_thd2~0_120 0) 0)))))) (= (store |v_#memory_int_234| |v_~#x~0.base_154| (store .cse23 |v_~#x~0.offset_154| |v_P1_#t~ite21_32|)) |v_#memory_int_233|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_42 |v_~#x~0.base_154|) (= v_~weak$$choice2~0_54 |v_P1Thread1of1ForFork0_#t~nondet7_6|) (= v_~weak$$choice0~0_73 |v_P1Thread1of1ForFork0_#t~nondet6_6|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= (ite (= (ite .cse1 .cse24 (ite .cse18 .cse24 (ite (and .cse15 .cse17) 0 (ite (and .cse14 .cse17 .cse9 .cse11) (ite (or .cse7 .cse3) 1 0) .cse25)))) 0) 0 1) v_~x$w_buff0_used~0_268) (= (ite .cse1 v_~x$w_buff1_used~0_238 (ite .cse19 v_~x$w_buff1_used~0_238 (ite .cse26 0 (ite (and .cse14 .cse21 .cse9 .cse11) v_~weak$$choice0~0_73 0)))) v_~x$w_buff1_used~0_237) (= v_~x$w_buff1~0_118 v_~x$w_buff1~0_117) (= v_~x$flush_delayed~0_42 0) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff0~0_133 v_~x$w_buff0~0_132) (= (ite .cse1 v_~x$r_buff0_thd2~0_124 (ite .cse19 v_~x$r_buff0_thd2~0_124 (ite .cse26 0 (ite (and .cse14 .cse21 .cse22 .cse9) v_~x$r_buff0_thd2~0_124 0)))) v_~x$r_buff0_thd2~0_123) (= v_~x$mem_tmp~0_24 .cse4) (= v_~__unbuffered_p1_EAX$read_delayed~0_37 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_133, P1Thread1of1ForFork0_#t~mem10=|v_P1Thread1of1ForFork0_#t~mem10_6|, P1Thread1of1ForFork0_#t~mem11=|v_P1Thread1of1ForFork0_#t~mem11_6|, P1Thread1of1ForFork0_#t~mem20=|v_P1Thread1of1ForFork0_#t~mem20_6|, P1Thread1of1ForFork0_#t~nondet7=|v_P1Thread1of1ForFork0_#t~nondet7_6|, ~#x~0.offset=|v_~#x~0.offset_154|, P1Thread1of1ForFork0_#t~nondet6=|v_P1Thread1of1ForFork0_#t~nondet6_6|, ~x$w_buff1~0=v_~x$w_buff1~0_118, P1Thread1of1ForFork0_#t~mem13=|v_P1Thread1of1ForFork0_#t~mem13_6|, P1Thread1of1ForFork0_#t~ite12=|v_P1Thread1of1ForFork0_#t~ite12_6|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_120, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_238, P1Thread1of1ForFork0_#t~nondet9=|v_P1Thread1of1ForFork0_#t~nondet9_6|, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_6|, P1Thread1of1ForFork0_#t~ite15=|v_P1Thread1of1ForFork0_#t~ite15_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_269, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_6|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, #memory_int=|v_#memory_int_234|, ~#x~0.base=|v_~#x~0.base_154|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_132, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_37, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~weak$$choice1~0=v_~weak$$choice1~0_72, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_5|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_42, P1Thread1of1ForFork0_#t~mem8=|v_P1Thread1of1ForFork0_#t~mem8_5|, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_154|, ~x$w_buff1~0=v_~x$w_buff1~0_117, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_42, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_119, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_237, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_123, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_268, ~weak$$choice0~0=v_~weak$$choice0~0_73, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, #memory_int=|v_#memory_int_233|, ~#x~0.base=|v_~#x~0.base_154|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, P1Thread1of1ForFork0_#t~mem19=|v_P1Thread1of1ForFork0_#t~mem19_5|, ~weak$$choice2~0=v_~weak$$choice2~0_54} AuxVars[|v_P1_#t~mem11_61|, |v_P1_#t~ite21_32|, |v_P1_#t~mem13_75|, |v_P1_#t~ite12_56|, |v_P1_#t~mem20_35|, |v_P1_#t~mem10_37|, |v_P1_#t~ite14_74|, |v_P1_#t~ite17_44|, |v_P1_#t~ite15_64|, |v_P1_#t~ite16_54|] 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, 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 [807] L761-->L836: Formula: (let ((.cse4 (= 0 (mod v_~x$r_buff0_thd3~0_155 256)))) (let ((.cse0 (not .cse4)) (.cse5 (not (= (mod v_~x$w_buff0_used~0_538 256) 0)))) (let ((.cse2 (and .cse0 .cse5)) (.cse3 (select |v_#memory_int_538| |v_~#x~0.base_270|)) (.cse1 (= (mod v_~x$w_buff0_used~0_540 256) 0))) (and (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_57| 0)) (= (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~x$w_buff0_used~0_540) v_~x$w_buff1_used~0_466) (= v_~x$w_buff0~0_319 v_~x$w_buff1~0_270) (= v_~x$w_buff0_used~0_538 (ite .cse0 0 1)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_57|) (= v_~x$r_buff0_thd1~0_183 1) (or (and (= (select .cse3 |v_~#x~0.offset_270|) |v_P2_#t~mem25_55|) (= |v_P2_#t~ite26_52| |v_P2_#t~mem25_55|) (= |v_P2_#t~ite26_52| |v_P2_#t~ite27_46|) .cse4) (and (= |v_P2Thread1of1ForFork1_#t~mem25_46| |v_P2_#t~mem25_55|) .cse0 (= |v_P2_#t~ite26_52| |v_P2Thread1of1ForFork1_#t~ite26_46|) (= |v_P2_#t~ite27_46| v_~x$w_buff0~0_318))) (= v_~x$w_buff0~0_318 1) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_155) v_~x$r_buff0_thd3~0_154) (= v_~x$r_buff0_thd1~0_184 v_~x$r_buff1_thd1~0_138) (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_466 256) 0))) (and .cse5 (not (= (mod v_~x$r_buff0_thd3~0_154 256) 0)))) 0 v_~x$r_buff0_thd3~0_155) v_~x$r_buff1_thd3~0_158) (= (store |v_#memory_int_538| |v_~#x~0.base_270| (store .cse3 |v_~#x~0.offset_270| |v_P2_#t~ite27_46|)) |v_#memory_int_537|) (= v_~x$r_buff0_thd0~0_166 v_~x$r_buff1_thd0~0_180) (= v_~x$r_buff0_thd2~0_251 v_~x$r_buff1_thd2~0_265) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57| (ite .cse1 1 0)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_319, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_166, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_184, ~#x~0.offset=|v_~#x~0.offset_270|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_46|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_540, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_46|, #memory_int=|v_#memory_int_538|, ~#x~0.base=|v_~#x~0.base_270|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_318, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_166, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, ~#x~0.offset=|v_~#x~0.offset_270|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_158, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_466, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_57|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_265, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_138, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_154, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_180, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_538, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_25|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_57|, #memory_int=|v_#memory_int_537|, ~#x~0.base=|v_~#x~0.base_270|} AuxVars[|v_P2_#t~mem25_55|, |v_P2_#t~ite27_46|, |v_P2_#t~ite26_52|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] [2022-12-06 04:24:14,056 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:14,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3696 [2022-12-06 04:24:14,057 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 149 flow [2022-12-06 04:24:14,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 04:24:14,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:14,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:14,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:24:14,057 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 04:24:14,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2040474057, now seen corresponding path program 1 times [2022-12-06 04:24:14,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:14,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267344194] [2022-12-06 04:24:14,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:14,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:14,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 04:24:14,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:14,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267344194] [2022-12-06 04:24:14,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267344194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:14,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069902345] [2022-12-06 04:24:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:14,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:14,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:14,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:24:14,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 149 flow. Second operand has 4 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 04:24:14,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:14,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:24:14,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:14,534 INFO L130 PetriNetUnfolder]: 1027/1580 cut-off events. [2022-12-06 04:24:14,534 INFO L131 PetriNetUnfolder]: For 1740/1740 co-relation queries the response was YES. [2022-12-06 04:24:14,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 1580 events. 1027/1580 cut-off events. For 1740/1740 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6965 event pairs, 271 based on Foata normal form. 46/1626 useless extension candidates. Maximal degree in co-relation 4573. Up to 737 conditions per place. [2022-12-06 04:24:14,541 INFO L137 encePairwiseOnDemand]: 21/25 looper letters, 40 selfloop transitions, 3 changer transitions 11/54 dead transitions. [2022-12-06 04:24:14,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 339 flow [2022-12-06 04:24:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 04:24:14,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49 [2022-12-06 04:24:14,543 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 149 flow. Second operand 4 states and 49 transitions. [2022-12-06 04:24:14,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 339 flow [2022-12-06 04:24:14,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 329 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 04:24:14,548 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 135 flow [2022-12-06 04:24:14,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2022-12-06 04:24:14,550 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2022-12-06 04:24:14,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:14,550 INFO L89 Accepts]: Start accepts. Operand has 44 places, 27 transitions, 135 flow [2022-12-06 04:24:14,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:14,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:14,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 135 flow [2022-12-06 04:24:14,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 27 transitions, 135 flow [2022-12-06 04:24:14,560 INFO L130 PetriNetUnfolder]: 12/55 cut-off events. [2022-12-06 04:24:14,560 INFO L131 PetriNetUnfolder]: For 89/93 co-relation queries the response was YES. [2022-12-06 04:24:14,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 55 events. 12/55 cut-off events. For 89/93 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 176 event pairs, 2 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 150. Up to 15 conditions per place. [2022-12-06 04:24:14,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 27 transitions, 135 flow [2022-12-06 04:24:14,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 04:24:18,156 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:18,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3607 [2022-12-06 04:24:18,157 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 139 flow [2022-12-06 04:24:18,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 04:24:18,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:18,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:18,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:24:18,158 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 04:24:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash -373300736, now seen corresponding path program 1 times [2022-12-06 04:24:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:18,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733746043] [2022-12-06 04:24:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:19,349 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 04:24:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733746043] [2022-12-06 04:24:19,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733746043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:19,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:19,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226468280] [2022-12-06 04:24:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:19,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:19,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 04:24:19,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 139 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 04:24:19,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:19,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 04:24:19,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:19,655 INFO L130 PetriNetUnfolder]: 812/1244 cut-off events. [2022-12-06 04:24:19,655 INFO L131 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2022-12-06 04:24:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3875 conditions, 1244 events. 812/1244 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5286 event pairs, 236 based on Foata normal form. 20/1259 useless extension candidates. Maximal degree in co-relation 3855. Up to 633 conditions per place. [2022-12-06 04:24:19,663 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 48 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2022-12-06 04:24:19,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 422 flow [2022-12-06 04:24:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 04:24:19,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:24:19,665 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 139 flow. Second operand 5 states and 66 transitions. [2022-12-06 04:24:19,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 422 flow [2022-12-06 04:24:19,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 393 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-06 04:24:19,670 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 213 flow [2022-12-06 04:24:19,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-06 04:24:19,670 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-06 04:24:19,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:19,670 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 213 flow [2022-12-06 04:24:19,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:19,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:19,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 213 flow [2022-12-06 04:24:19,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 213 flow [2022-12-06 04:24:19,696 INFO L130 PetriNetUnfolder]: 64/163 cut-off events. [2022-12-06 04:24:19,696 INFO L131 PetriNetUnfolder]: For 338/359 co-relation queries the response was YES. [2022-12-06 04:24:19,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 163 events. 64/163 cut-off events. For 338/359 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 736 event pairs, 15 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 524. Up to 89 conditions per place. [2022-12-06 04:24:19,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 213 flow [2022-12-06 04:24:19,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-06 04:24:19,772 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 [787] L856-3-->L858-2: Formula: (and (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t1782~0#1.base_54|) (= 0 |v_ULTIMATE.start_main_~#t1782~0#1.offset_38|) (= |v_#pthreadsForks_39| |v_ULTIMATE.start_main_#t~pre32#1_19|) (= (select |v_#valid_124| |v_ULTIMATE.start_main_~#t1782~0#1.base_54|) 0) (= |v_#valid_123| (store |v_#valid_124| |v_ULTIMATE.start_main_~#t1782~0#1.base_54| 1)) (= |v_#pthreadsForks_38| (+ |v_#pthreadsForks_39| 1)) (= (store |v_#length_57| |v_ULTIMATE.start_main_~#t1782~0#1.base_54| 4) |v_#length_56|) (not (= |v_ULTIMATE.start_main_~#t1782~0#1.base_54| 0)) (= (store |v_#memory_int_340| |v_ULTIMATE.start_main_~#t1782~0#1.base_54| (store (select |v_#memory_int_340| |v_ULTIMATE.start_main_~#t1782~0#1.base_54|) |v_ULTIMATE.start_main_~#t1782~0#1.offset_38| |v_ULTIMATE.start_main_#t~pre32#1_19|)) |v_#memory_int_339|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #pthreadsForks=|v_#pthreadsForks_39|, #valid=|v_#valid_124|, #memory_int=|v_#memory_int_340|, #length=|v_#length_57|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_25|, #pthreadsForks=|v_#pthreadsForks_38|, #valid=|v_#valid_123|, #memory_int=|v_#memory_int_339|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_15|, #length=|v_#length_56|, ULTIMATE.start_main_~#t1782~0#1.base=|v_ULTIMATE.start_main_~#t1782~0#1.base_54|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_19|, ULTIMATE.start_main_~#t1782~0#1.offset=|v_ULTIMATE.start_main_~#t1782~0#1.offset_38|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_21|} AuxVars[] AssignedVars[#pthreadsForks, #valid, #memory_int, ULTIMATE.start_main_#t~nondet31#1, #length, ULTIMATE.start_main_~#t1782~0#1.base, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_~#t1782~0#1.offset, ULTIMATE.start_main_#t~pre30#1] [2022-12-06 04:24:19,983 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 [757] L2-1-->L869: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) (let ((.cse0 (= (mod v_~x$w_buff0_used~0_315 256) 0)) (.cse9 (not .cse1)) (.cse10 (not (= (mod v_~x$w_buff0_used~0_314 256) 0))) (.cse6 (= (mod v_~x$r_buff1_thd0~0_61 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_280 256) 0))) (let ((.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (select |v_#memory_int_288| |v_~#x~0.base_176|)) (.cse11 (and .cse9 .cse10)) (.cse8 (not .cse0))) (and (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem34#1_46| |v_ULTIMATE.start_main_#t~mem34#1_44|))) (or (and (or .cse0 .cse1) (= |v_ULTIMATE.start_main_#t~ite35#1_43| |v_ULTIMATE.start_main_#t~ite36#1_40|) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_43| v_~x$w_buff1~0_151) .cse2 .cse3 .cse4) (and (= |v_ULTIMATE.start_main_#t~mem34#1_44| (select .cse5 |v_~#x~0.offset_176|)) (= |v_ULTIMATE.start_main_#t~ite35#1_43| |v_ULTIMATE.start_main_#t~mem34#1_44|) (or .cse6 .cse7)))) (and .cse8 (= |v_ULTIMATE.start_main_#t~ite36#1_40| v_~x$w_buff0~0_170) .cse2 .cse9 (= |v_ULTIMATE.start_main_#t~ite35#1_45| |v_ULTIMATE.start_main_#t~ite35#1_43|)))) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_50 256) 0)) .cse10) (and (not (= (mod v_~x$w_buff1_used~0_279 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_61) v_~x$r_buff1_thd0~0_60) (= v_~x$w_buff1_used~0_279 (ite (or (and .cse3 .cse4) .cse11) 0 v_~x$w_buff1_used~0_280)) (= (store |v_#memory_int_288| |v_~#x~0.base_176| (store .cse5 |v_~#x~0.offset_176| |v_ULTIMATE.start_main_#t~ite36#1_40|)) |v_#memory_int_287|) (= (ite .cse11 0 v_~x$r_buff0_thd0~0_51) v_~x$r_buff0_thd0~0_50) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_315) v_~x$w_buff0_used~0_314))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_170, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_45|, ~#x~0.offset=|v_~#x~0.offset_176|, ~x$w_buff1~0=v_~x$w_buff1~0_151, #memory_int=|v_#memory_int_288|, ~#x~0.base=|v_~#x~0.base_176|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_280, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_46|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_315} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_170, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_39|, ~#x~0.offset=|v_~#x~0.offset_176|, ~x$w_buff1~0=v_~x$w_buff1~0_151, #memory_int=|v_#memory_int_287|, ~#x~0.base=|v_~#x~0.base_176|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_279, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_43|, |v_ULTIMATE.start_main_#t~ite36#1_40|, |v_ULTIMATE.start_main_#t~mem34#1_44|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~ite36#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-06 04:24:20,617 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 04:24:21,028 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 04:24:21,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [814] L761-->L816: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd2~0_319 256) 0))) (let ((.cse5 (not (= (mod v_~x$w_buff0_used~0_665 256) 0))) (.cse2 (not .cse3))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_667 256) 0)) (.cse0 (and .cse5 .cse2)) (.cse4 (select |v_#memory_int_663| |v_~#x~0.base_322|))) (and (= v_~x$w_buff0~0_400 1) (= (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~x$w_buff0_used~0_667) v_~x$w_buff1_used~0_572) (or (and (= |v_P1_#t~ite23_62| |v_P1_#t~ite24_56|) (= |v_P1_#t~ite23_62| |v_P1_#t~mem22_67|) .cse3 (= (select .cse4 |v_~#x~0.offset_322|) |v_P1_#t~mem22_67|)) (and (= |v_P1Thread1of1ForFork0_#t~mem22_58| |v_P1_#t~mem22_67|) (= |v_P1_#t~ite24_56| v_~x$w_buff0~0_400) (= |v_P1_#t~ite23_62| |v_P1Thread1of1ForFork0_#t~ite23_58|) .cse2)) (= v_~x$r_buff0_thd3~0_192 v_~x$r_buff1_thd3~0_185) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_82| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_82|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_82| 0)) (= v_~x$w_buff0_used~0_665 (ite .cse2 0 1)) (= (ite .cse1 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_82|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_572 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_318 256) 0)) .cse5)) 0 v_~x$r_buff0_thd2~0_319) v_~x$r_buff1_thd2~0_334) (= v_~x$r_buff0_thd2~0_318 (ite .cse0 0 v_~x$r_buff0_thd2~0_319)) (= v_~x$r_buff0_thd1~0_244 v_~x$r_buff1_thd1~0_173) (= v_~x$r_buff0_thd0~0_239 v_~x$r_buff1_thd0~0_258) (= v_~x$w_buff0~0_401 v_~x$w_buff1~0_340) (= v_~x$r_buff0_thd1~0_243 1) (= (store |v_#memory_int_663| |v_~#x~0.base_322| (store .cse4 |v_~#x~0.offset_322| |v_P1_#t~ite24_56|)) |v_#memory_int_662|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_401, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_58|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_239, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_244, ~#x~0.offset=|v_~#x~0.offset_322|, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_58|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_192, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_319, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_667, #memory_int=|v_#memory_int_663|, ~#x~0.base=|v_~#x~0.base_322|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_400, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_239, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_243, ~#x~0.offset=|v_~#x~0.offset_322|, ~x$w_buff1~0=v_~x$w_buff1~0_340, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_334, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_572, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_185, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_173, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_192, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_318, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_258, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_665, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_82|, #memory_int=|v_#memory_int_662|, ~#x~0.base=|v_~#x~0.base_322|} AuxVars[|v_P1_#t~ite23_62|, |v_P1_#t~ite24_56|, |v_P1_#t~mem22_67|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~ite24, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [661] L773-->L780: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_215 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_214 256) 0))) (.cse5 (not .cse10))) (let ((.cse3 (and .cse0 .cse5)) (.cse2 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (select |v_#memory_int_182| |v_~#x~0.base_124|)) (.cse4 (not .cse11))) (and (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_37)) (= v_~x$w_buff1_used~0_191 (ite (or (and .cse2 .cse1) .cse3) 0 v_~x$w_buff1_used~0_192)) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_215) v_~x$w_buff0_used~0_214) (= (store |v_#memory_int_182| |v_~#x~0.base_124| (store .cse6 |v_~#x~0.offset_124| |v_P0_#t~ite5#1_29|)) |v_#memory_int_181|) (= v_~x$r_buff0_thd1~0_41 (ite .cse3 0 v_~x$r_buff0_thd1~0_42)) (let ((.cse7 (= |v_P0_#t~mem3#1_28| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and .cse7 .cse2 .cse1 (= |v_P0_#t~ite4#1_31| v_~x$w_buff1~0_77)) (and (= |v_P0_#t~mem3#1_28| |v_P0_#t~ite4#1_31|) (= |v_P0_#t~mem3#1_28| (select .cse6 |v_~#x~0.offset_124|)) (or .cse8 .cse9))) (or .cse10 .cse11) (= |v_P0_#t~ite4#1_31| |v_P0_#t~ite5#1_29|)) (and .cse7 (= |v_P0_#t~ite4#1_31| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse4 (= |v_P0_#t~ite5#1_29| v_~x$w_buff0~0_86) .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_181|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_214} AuxVars[|v_P0_#t~ite5#1_29|, |v_P0_#t~ite4#1_31|, |v_P0_#t~mem3#1_28|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-06 04:24:22,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [815] L761-->L836: Formula: (let ((.cse3 (= (mod v_~x$r_buff0_thd3~0_195 256) 0))) (let ((.cse0 (not .cse3)) (.cse2 (not (= (mod v_~x$w_buff0_used~0_671 256) 0)))) (let ((.cse1 (select |v_#memory_int_667| |v_~#x~0.base_324|)) (.cse5 (and .cse0 .cse2)) (.cse4 (= (mod v_~x$w_buff0_used~0_673 256) 0))) (and (= (ite .cse0 0 1) v_~x$w_buff0_used~0_671) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_84| 0)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_84| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_84|) (= |v_#memory_int_666| (store |v_#memory_int_667| |v_~#x~0.base_324| (store .cse1 |v_~#x~0.offset_324| |v_P2_#t~ite27_60|))) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_194 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_576 256) 0)) .cse0)) 0 v_~x$r_buff0_thd3~0_195) v_~x$r_buff1_thd3~0_187) (= v_~x$w_buff0~0_405 v_~x$w_buff1~0_342) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_260) (= v_~x$w_buff0~0_404 1) (or (and (= |v_P2Thread1of1ForFork1_#t~mem25_72| |v_P2_#t~mem25_69|) .cse0 (= |v_P2_#t~ite27_60| v_~x$w_buff0~0_404) (= |v_P2_#t~ite26_66| |v_P2Thread1of1ForFork1_#t~ite26_72|)) (and .cse3 (= |v_P2_#t~ite26_66| |v_P2_#t~mem25_69|) (= |v_P2_#t~ite26_66| |v_P2_#t~ite27_60|) (= (select .cse1 |v_~#x~0.offset_324|) |v_P2_#t~mem25_69|))) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_84| (ite .cse4 1 0)) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_195) v_~x$r_buff0_thd3~0_194) (= (ite (or .cse5 (and (not .cse4) .cse0)) 0 v_~x$w_buff0_used~0_673) v_~x$w_buff1_used~0_576) (= v_~x$r_buff0_thd1~0_247 1) (= v_~x$r_buff0_thd1~0_248 v_~x$r_buff1_thd1~0_175) (= v_~x$r_buff0_thd2~0_322 v_~x$r_buff1_thd2~0_338))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_405, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_248, ~#x~0.offset=|v_~#x~0.offset_324|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_72|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_195, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_322, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_673, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_72|, #memory_int=|v_#memory_int_667|, ~#x~0.base=|v_~#x~0.base_324|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_404, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_247, ~#x~0.offset=|v_~#x~0.offset_324|, ~x$w_buff1~0=v_~x$w_buff1~0_342, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_187, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_576, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_84|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_338, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_175, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_194, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_322, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_260, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_671, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_38|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_84|, #memory_int=|v_#memory_int_666|, ~#x~0.base=|v_~#x~0.base_324|} AuxVars[|v_P2_#t~ite26_66|, |v_P2_#t~ite27_60|, |v_P2_#t~mem25_69|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [661] L773-->L780: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_215 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_214 256) 0))) (.cse5 (not .cse10))) (let ((.cse3 (and .cse0 .cse5)) (.cse2 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (select |v_#memory_int_182| |v_~#x~0.base_124|)) (.cse4 (not .cse11))) (and (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_37)) (= v_~x$w_buff1_used~0_191 (ite (or (and .cse2 .cse1) .cse3) 0 v_~x$w_buff1_used~0_192)) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_215) v_~x$w_buff0_used~0_214) (= (store |v_#memory_int_182| |v_~#x~0.base_124| (store .cse6 |v_~#x~0.offset_124| |v_P0_#t~ite5#1_29|)) |v_#memory_int_181|) (= v_~x$r_buff0_thd1~0_41 (ite .cse3 0 v_~x$r_buff0_thd1~0_42)) (let ((.cse7 (= |v_P0_#t~mem3#1_28| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and .cse7 .cse2 .cse1 (= |v_P0_#t~ite4#1_31| v_~x$w_buff1~0_77)) (and (= |v_P0_#t~mem3#1_28| |v_P0_#t~ite4#1_31|) (= |v_P0_#t~mem3#1_28| (select .cse6 |v_~#x~0.offset_124|)) (or .cse8 .cse9))) (or .cse10 .cse11) (= |v_P0_#t~ite4#1_31| |v_P0_#t~ite5#1_29|)) (and .cse7 (= |v_P0_#t~ite4#1_31| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse4 (= |v_P0_#t~ite5#1_29| v_~x$w_buff0~0_86) .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_181|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_214} AuxVars[|v_P0_#t~ite5#1_29|, |v_P0_#t~ite4#1_31|, |v_P0_#t~mem3#1_28|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-06 04:24:23,097 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:23,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3428 [2022-12-06 04:24:23,098 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 233 flow [2022-12-06 04:24:23,098 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 04:24:23,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:23,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:23,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:24:23,098 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 04:24:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 401150880, now seen corresponding path program 2 times [2022-12-06 04:24:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:23,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503589560] [2022-12-06 04:24:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:23,251 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 04:24:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:23,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503589560] [2022-12-06 04:24:23,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503589560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:23,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:23,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712433063] [2022-12-06 04:24:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:23,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:23,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:23,253 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:24:23,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 233 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:23,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:23,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:24:23,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:23,543 INFO L130 PetriNetUnfolder]: 992/1506 cut-off events. [2022-12-06 04:24:23,544 INFO L131 PetriNetUnfolder]: For 3504/3504 co-relation queries the response was YES. [2022-12-06 04:24:23,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5383 conditions, 1506 events. 992/1506 cut-off events. For 3504/3504 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6749 event pairs, 221 based on Foata normal form. 44/1550 useless extension candidates. Maximal degree in co-relation 5365. Up to 673 conditions per place. [2022-12-06 04:24:23,552 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 3 changer transitions 39/73 dead transitions. [2022-12-06 04:24:23,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 608 flow [2022-12-06 04:24:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 04:24:23,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45517241379310347 [2022-12-06 04:24:23,555 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 233 flow. Second operand 5 states and 66 transitions. [2022-12-06 04:24:23,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 608 flow [2022-12-06 04:24:23,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 556 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 04:24:23,562 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 189 flow [2022-12-06 04:24:23,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-12-06 04:24:23,564 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2022-12-06 04:24:23,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:23,564 INFO L89 Accepts]: Start accepts. Operand has 45 places, 30 transitions, 189 flow [2022-12-06 04:24:23,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:23,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:23,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 30 transitions, 189 flow [2022-12-06 04:24:23,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 189 flow [2022-12-06 04:24:23,584 INFO L130 PetriNetUnfolder]: 54/127 cut-off events. [2022-12-06 04:24:23,585 INFO L131 PetriNetUnfolder]: For 300/309 co-relation queries the response was YES. [2022-12-06 04:24:23,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 127 events. 54/127 cut-off events. For 300/309 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 488 event pairs, 9 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 409. Up to 78 conditions per place. [2022-12-06 04:24:23,587 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 189 flow [2022-12-06 04:24:23,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 04:24:25,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L829: Formula: (and (= v_~y~0_120 v_~__unbuffered_p2_EAX~0_108) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~y~0_119 2) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_120} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_119} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [822] $Ultimate##0-->L780: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd3~0_213 256) 0))) (let ((.cse3 (not .cse11))) (let ((.cse9 (ite .cse3 0 1))) (let ((.cse1 (= (mod .cse9 256) 0))) (let ((.cse2 (not .cse1))) (let ((.cse10 (= (mod v_~x$w_buff0_used~0_706 256) 0)) (.cse5 (and .cse3 .cse2))) (let ((.cse8 (ite (or (and (not .cse10) .cse3) .cse5) 0 v_~x$w_buff0_used~0_706))) (let ((.cse4 (not (= (mod .cse8 256) 0))) (.cse7 (not (= (mod v_~x$r_buff0_thd1~0_280 256) 0))) (.cse0 (select |v_#memory_int_699| |v_~#x~0.base_338|)) (.cse6 (not (= 0 (mod v_~x$w_buff0_used~0_705 256))))) (and (= (store |v_#memory_int_699| |v_~#x~0.base_338| (store .cse0 |v_~#x~0.offset_338| |v_P0_#t~ite5#1_56|)) |v_#memory_int_698|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_98| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_98|) (= v_~x$r_buff0_thd0~0_257 v_~x$r_buff1_thd0~0_274) (= v_~y~0_143 v_~__unbuffered_p0_EAX~0_109) (or (and (= |v_P0_#t~ite4#1_58| |v_P0_#t~ite5#1_56|) (= |v_P0_#t~mem3#1_55| |v_P2_#t~ite27_64|) .cse1 (= |v_P0_#t~mem3#1_55| |v_P0_#t~ite4#1_58|)) (and (= |v_P0_#t~ite5#1_56| v_~x$w_buff0~0_432) (= |v_P0_#t~ite4#1_58| |v_P0Thread1of1ForFork2_#t~ite4#1_60|) .cse2 (= |v_P0_#t~mem3#1_55| |v_P0Thread1of1ForFork2_#t~mem3#1_60|))) (= v_~x$w_buff0~0_432 1) (= (ite (or (and .cse3 .cse4) (and (not (= (mod v_~x$r_buff0_thd3~0_212 256) 0)) .cse2)) 0 v_~x$r_buff0_thd3~0_213) v_~x$r_buff1_thd3~0_203) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_34| |v_P0Thread1of1ForFork2_~arg#1.offset_34|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_34| |v_P0Thread1of1ForFork2_~arg#1.base_34|) (= (ite .cse5 0 v_~x$r_buff0_thd3~0_213) v_~x$r_buff0_thd3~0_212) (= (ite (or .cse6 (and .cse7 .cse4)) 0 .cse8) v_~x$w_buff1_used~0_596) (= v_~x$w_buff0_used~0_705 (ite .cse2 0 .cse9)) (= v_~x$r_buff0_thd2~0_340 v_~x$r_buff1_thd2~0_352) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_98| 0)) (= v_~x$w_buff0~0_433 v_~x$w_buff1~0_356) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_98| (ite .cse10 1 0)) (= v_~x$r_buff1_thd1~0_193 (ite (or (and .cse6 (not (= (mod v_~x$r_buff0_thd1~0_279 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_596 256) 0)) .cse7)) 0 v_~x$r_buff0_thd1~0_280)) (or (and .cse11 (= |v_P2_#t~ite26_70| |v_P2_#t~ite27_64|) (= |v_P2_#t~mem25_73| (select .cse0 |v_~#x~0.offset_338|)) (= |v_P2_#t~ite26_70| |v_P2_#t~mem25_73|)) (and (= |v_P2_#t~ite27_64| v_~x$w_buff0~0_432) .cse3 (= |v_P2Thread1of1ForFork1_#t~mem25_80| |v_P2_#t~mem25_73|) (= |v_P2_#t~ite26_70| |v_P2Thread1of1ForFork1_#t~ite26_80|))) (= v_~x$r_buff0_thd1~0_279 (ite .cse6 0 1))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_433, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_257, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ~#x~0.offset=|v_~#x~0.offset_338|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_80|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_34|, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_60|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_213, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_34|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_340, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_60|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_706, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_80|, #memory_int=|v_#memory_int_699|, ~#x~0.base=|v_~#x~0.base_338|, ~y~0=v_~y~0_143} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_279, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_203, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_98|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_193, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_212, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_34|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_42|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_98|, ~y~0=v_~y~0_143, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_257, ~#x~0.offset=|v_~#x~0.offset_338|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_34|, ~x$w_buff1~0=v_~x$w_buff1~0_356, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_596, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_340, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_274, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_705, #memory_int=|v_#memory_int_698|, ~#x~0.base=|v_~#x~0.base_338|, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_37|} AuxVars[|v_P2_#t~ite27_64|, |v_P0_#t~mem3#1_55|, |v_P2_#t~mem25_73|, |v_P0_#t~ite5#1_56|, |v_P0_#t~ite4#1_58|, |v_P2_#t~ite26_70|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, 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, P0Thread1of1ForFork2_#t~mem3#1, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_#t~ite4#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int, P0Thread1of1ForFork2_#t~ite5#1] [2022-12-06 04:24:25,962 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:25,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2399 [2022-12-06 04:24:25,963 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 217 flow [2022-12-06 04:24:25,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:25,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:25,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:25,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:24:25,963 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 04:24:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1518978447, now seen corresponding path program 1 times [2022-12-06 04:24:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:25,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271843220] [2022-12-06 04:24:25,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:26,854 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 04:24:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:26,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271843220] [2022-12-06 04:24:26,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271843220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:26,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:26,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846426410] [2022-12-06 04:24:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:24:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:24:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:24:26,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:24:26,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 217 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 04:24:26,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:26,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:24:26,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:27,110 INFO L130 PetriNetUnfolder]: 475/742 cut-off events. [2022-12-06 04:24:27,110 INFO L131 PetriNetUnfolder]: For 1765/1765 co-relation queries the response was YES. [2022-12-06 04:24:27,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 742 events. 475/742 cut-off events. For 1765/1765 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2966 event pairs, 144 based on Foata normal form. 16/758 useless extension candidates. Maximal degree in co-relation 2649. Up to 361 conditions per place. [2022-12-06 04:24:27,115 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 30 selfloop transitions, 16 changer transitions 0/46 dead transitions. [2022-12-06 04:24:27,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 367 flow [2022-12-06 04:24:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 04:24:27,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2022-12-06 04:24:27,116 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 217 flow. Second operand 5 states and 47 transitions. [2022-12-06 04:24:27,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 367 flow [2022-12-06 04:24:27,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 347 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-06 04:24:27,119 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 278 flow [2022-12-06 04:24:27,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 04:24:27,120 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-06 04:24:27,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:27,120 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 278 flow [2022-12-06 04:24:27,121 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:27,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:27,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 278 flow [2022-12-06 04:24:27,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 278 flow [2022-12-06 04:24:27,144 INFO L130 PetriNetUnfolder]: 56/134 cut-off events. [2022-12-06 04:24:27,144 INFO L131 PetriNetUnfolder]: For 407/453 co-relation queries the response was YES. [2022-12-06 04:24:27,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 134 events. 56/134 cut-off events. For 407/453 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 520 event pairs, 6 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 536. Up to 79 conditions per place. [2022-12-06 04:24:27,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 278 flow [2022-12-06 04:24:27,146 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:24:27,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:27,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-06 04:24:27,258 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 281 flow [2022-12-06 04:24:27,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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 04:24:27,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:27,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:24:27,258 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 04:24:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1536061958, now seen corresponding path program 1 times [2022-12-06 04:24:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:27,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260304931] [2022-12-06 04:24:27,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:27,416 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 04:24:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:27,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260304931] [2022-12-06 04:24:27,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260304931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:27,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:27,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:24:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837118804] [2022-12-06 04:24:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:27,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:24:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:24:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:24:27,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:24:27,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 04:24:27,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:27,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:24:27,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:27,565 INFO L130 PetriNetUnfolder]: 283/482 cut-off events. [2022-12-06 04:24:27,565 INFO L131 PetriNetUnfolder]: For 1431/1431 co-relation queries the response was YES. [2022-12-06 04:24:27,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 482 events. 283/482 cut-off events. For 1431/1431 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1966 event pairs, 40 based on Foata normal form. 30/512 useless extension candidates. Maximal degree in co-relation 2029. Up to 417 conditions per place. [2022-12-06 04:24:27,568 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 45 selfloop transitions, 4 changer transitions 2/51 dead transitions. [2022-12-06 04:24:27,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 514 flow [2022-12-06 04:24:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:24:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:24:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:24:27,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 04:24:27,569 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 281 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:24:27,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 514 flow [2022-12-06 04:24:27,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 448 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 04:24:27,571 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 256 flow [2022-12-06 04:24:27,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=256, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 04:24:27,571 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2022-12-06 04:24:27,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:27,571 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 256 flow [2022-12-06 04:24:27,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:27,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:27,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 256 flow [2022-12-06 04:24:27,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 256 flow [2022-12-06 04:24:27,599 INFO L130 PetriNetUnfolder]: 100/220 cut-off events. [2022-12-06 04:24:27,599 INFO L131 PetriNetUnfolder]: For 336/346 co-relation queries the response was YES. [2022-12-06 04:24:27,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 220 events. 100/220 cut-off events. For 336/346 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 979 event pairs, 20 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 752. Up to 91 conditions per place. [2022-12-06 04:24:27,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 256 flow [2022-12-06 04:24:27,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 04:24:27,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:24:27,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-06 04:24:27,879 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 259 flow [2022-12-06 04:24:27,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 04:24:27,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:27,879 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:27,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:24:27,879 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 04:24:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1556401518, now seen corresponding path program 1 times [2022-12-06 04:24:27,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:27,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834707578] [2022-12-06 04:24:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:28,068 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 04:24:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:28,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834707578] [2022-12-06 04:24:28,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834707578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:28,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:28,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:24:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752862743] [2022-12-06 04:24:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:24:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:28,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:24:28,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:24:28,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:24:28,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:28,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:28,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:24:28,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:28,172 INFO L130 PetriNetUnfolder]: 96/194 cut-off events. [2022-12-06 04:24:28,172 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2022-12-06 04:24:28,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 194 events. 96/194 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 657 event pairs, 5 based on Foata normal form. 25/216 useless extension candidates. Maximal degree in co-relation 883. Up to 80 conditions per place. [2022-12-06 04:24:28,174 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 51 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2022-12-06 04:24:28,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 536 flow [2022-12-06 04:24:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:24:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:24:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 04:24:28,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2022-12-06 04:24:28,175 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 259 flow. Second operand 4 states and 50 transitions. [2022-12-06 04:24:28,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 536 flow [2022-12-06 04:24:28,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 507 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:24:28,178 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 278 flow [2022-12-06 04:24:28,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-06 04:24:28,179 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-06 04:24:28,179 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:28,179 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 278 flow [2022-12-06 04:24:28,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:28,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:28,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 278 flow [2022-12-06 04:24:28,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 278 flow [2022-12-06 04:24:28,198 INFO L130 PetriNetUnfolder]: 40/119 cut-off events. [2022-12-06 04:24:28,198 INFO L131 PetriNetUnfolder]: For 169/178 co-relation queries the response was YES. [2022-12-06 04:24:28,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 119 events. 40/119 cut-off events. For 169/178 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 441 event pairs, 1 based on Foata normal form. 5/121 useless extension candidates. Maximal degree in co-relation 428. Up to 45 conditions per place. [2022-12-06 04:24:28,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 278 flow [2022-12-06 04:24:28,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 04:24:28,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L858-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_46 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_37| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_11|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_21|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [820] $Ultimate##0-->L869: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd0~0_252 256) 0))) (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_697 256) 0))) (.cse0 (not .cse5))) (let ((.cse1 (= (mod v_~x$w_buff0_used~0_698 256) 0)) (.cse2 (and .cse3 .cse0)) (.cse4 (select |v_#memory_int_691| |v_~#x~0.base_334|))) (and (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_30| |v_P0Thread1of1ForFork2_~arg#1.offset_30|) (= v_~x$r_buff0_thd1~0_271 1) (= v_~x$w_buff0~0_424 1) (= v_~x$r_buff0_thd1~0_272 v_~x$r_buff1_thd1~0_189) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_94| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_94|) (= v_~x$r_buff0_thd2~0_336 v_~x$r_buff1_thd2~0_348) (= v_~x$w_buff0_used~0_697 (ite .cse0 0 1)) (= (ite .cse1 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_94|) (= v_~x$w_buff1_used~0_592 (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~x$w_buff0_used~0_698)) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_251 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_592 256) 0)) .cse0)) 0 v_~x$r_buff0_thd0~0_252) v_~x$r_buff1_thd0~0_270) (= v_~x$w_buff0~0_425 v_~x$w_buff1~0_352) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_94| 0)) (= v_~x$r_buff0_thd0~0_251 (ite .cse2 0 v_~x$r_buff0_thd0~0_252)) (= v_~x$r_buff0_thd3~0_208 v_~x$r_buff1_thd3~0_199) (= (store |v_#memory_int_691| |v_~#x~0.base_334| (store .cse4 |v_~#x~0.offset_334| |v_ULTIMATE.start_main_#t~ite36#1_178|)) |v_#memory_int_690|) (or (and (= v_~x$w_buff0~0_424 |v_ULTIMATE.start_main_#t~ite36#1_178|) (= |v_ULTIMATE.start_main_#t~ite35#1_244| |v_ULTIMATE.start_main_#t~ite35#1_242|) (= |v_ULTIMATE.start_main_#t~mem34#1_246| |v_ULTIMATE.start_main_#t~mem34#1_244|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem34#1_244| |v_ULTIMATE.start_main_#t~ite35#1_242|) .cse5 (= |v_ULTIMATE.start_main_#t~ite35#1_242| |v_ULTIMATE.start_main_#t~ite36#1_178|) (= |v_ULTIMATE.start_main_#t~mem34#1_244| (select .cse4 |v_~#x~0.offset_334|)))) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_30| |v_P0Thread1of1ForFork2_~arg#1.base_30|) (= v_~y~0_139 v_~__unbuffered_p0_EAX~0_105))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_425, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_252, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_272, ~#x~0.offset=|v_~#x~0.offset_334|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_30|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_208, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_246|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_30|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_336, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_698, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_244|, #memory_int=|v_#memory_int_691|, ~#x~0.base=|v_~#x~0.base_334|, ~y~0=v_~y~0_139} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_424, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_177|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_271, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_94|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_189, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_208, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_30|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_94|, ~y~0=v_~y~0_139, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_251, ~#x~0.offset=|v_~#x~0.offset_334|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_30|, ~x$w_buff1~0=v_~x$w_buff1~0_352, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_270, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_336, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_697, #memory_int=|v_#memory_int_690|, ~#x~0.base=|v_~#x~0.base_334|} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_242|, |v_ULTIMATE.start_main_#t~mem34#1_244|, |v_ULTIMATE.start_main_#t~ite36#1_178|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite36#1, ~x$r_buff0_thd1~0, ~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, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite35#1, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] [2022-12-06 04:24:29,706 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:24:29,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1528 [2022-12-06 04:24:29,707 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 290 flow [2022-12-06 04:24:29,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:29,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:29,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:24:29,708 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 04:24:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1003682946, now seen corresponding path program 1 times [2022-12-06 04:24:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:29,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104500978] [2022-12-06 04:24:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:29,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:24:29,890 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 04:24:29,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:24:29,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104500978] [2022-12-06 04:24:29,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104500978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:24:29,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:24:29,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:24:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002279370] [2022-12-06 04:24:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:24:29,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:24:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:24:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:24:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:24:29,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:24:29,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:29,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:24:29,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:24:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:24:29,995 INFO L130 PetriNetUnfolder]: 71/145 cut-off events. [2022-12-06 04:24:29,995 INFO L131 PetriNetUnfolder]: For 474/474 co-relation queries the response was YES. [2022-12-06 04:24:29,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 145 events. 71/145 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 484 event pairs, 2 based on Foata normal form. 11/153 useless extension candidates. Maximal degree in co-relation 676. Up to 63 conditions per place. [2022-12-06 04:24:29,996 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 46 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2022-12-06 04:24:29,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 512 flow [2022-12-06 04:24:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:24:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:24:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 04:24:29,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35172413793103446 [2022-12-06 04:24:29,997 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 290 flow. Second operand 5 states and 51 transitions. [2022-12-06 04:24:29,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 512 flow [2022-12-06 04:24:29,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 473 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 04:24:29,999 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 254 flow [2022-12-06 04:24:29,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=254, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-06 04:24:30,000 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2022-12-06 04:24:30,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:24:30,000 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 254 flow [2022-12-06 04:24:30,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:24:30,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:24:30,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 254 flow [2022-12-06 04:24:30,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 254 flow [2022-12-06 04:24:30,015 INFO L130 PetriNetUnfolder]: 27/83 cut-off events. [2022-12-06 04:24:30,015 INFO L131 PetriNetUnfolder]: For 152/157 co-relation queries the response was YES. [2022-12-06 04:24:30,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 83 events. 27/83 cut-off events. For 152/157 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 286 event pairs, 0 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 289. Up to 26 conditions per place. [2022-12-06 04:24:30,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 254 flow [2022-12-06 04:24:30,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 04:24:31,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [827] $Ultimate##0-->L773: Formula: (and (= v_~x$r_buff0_thd2~0_354 v_~x$r_buff1_thd2~0_362) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_606 256) 0)) (not (= (mod v_~x$w_buff0_used~0_725 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_108|) (= v_~x$w_buff0~0_452 1) (= v_~x$w_buff0_used~0_726 v_~x$w_buff1_used~0_606) (= v_~x$r_buff0_thd3~0_226 v_~x$r_buff1_thd3~0_213) (= v_~x$r_buff0_thd0~0_267 v_~x$r_buff1_thd0~0_284) (= v_~x$r_buff0_thd1~0_300 v_~x$r_buff1_thd1~0_203) (= v_~x$r_buff0_thd1~0_299 1) (= v_~x$w_buff0_used~0_725 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_108| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_108|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_108| 0)) (= v_~x$w_buff0~0_453 v_~x$w_buff1~0_366) (= v_~y~0_155 v_~__unbuffered_p0_EAX~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_44| |v_P0Thread1of1ForFork2_~arg#1.offset_44|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_44| |v_P0Thread1of1ForFork2_~arg#1.base_44|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_453, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_267, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_300, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_44|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_226, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_44|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_354, ~y~0=v_~y~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_726} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_452, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_267, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_299, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_44|, ~x$w_buff1~0=v_~x$w_buff1~0_366, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_108|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_362, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_226, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_44|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_354, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_284, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_44|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_725, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_119, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_108|, ~y~0=v_~y~0_155} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~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, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1] 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 04:24:32,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [827] $Ultimate##0-->L773: Formula: (and (= v_~x$r_buff0_thd2~0_354 v_~x$r_buff1_thd2~0_362) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_606 256) 0)) (not (= (mod v_~x$w_buff0_used~0_725 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_108|) (= v_~x$w_buff0~0_452 1) (= v_~x$w_buff0_used~0_726 v_~x$w_buff1_used~0_606) (= v_~x$r_buff0_thd3~0_226 v_~x$r_buff1_thd3~0_213) (= v_~x$r_buff0_thd0~0_267 v_~x$r_buff1_thd0~0_284) (= v_~x$r_buff0_thd1~0_300 v_~x$r_buff1_thd1~0_203) (= v_~x$r_buff0_thd1~0_299 1) (= v_~x$w_buff0_used~0_725 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_108| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_108|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_108| 0)) (= v_~x$w_buff0~0_453 v_~x$w_buff1~0_366) (= v_~y~0_155 v_~__unbuffered_p0_EAX~0_119) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_44| |v_P0Thread1of1ForFork2_~arg#1.offset_44|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_44| |v_P0Thread1of1ForFork2_~arg#1.base_44|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_453, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_267, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_300, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_44|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_226, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_44|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_354, ~y~0=v_~y~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_726} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_452, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_267, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_299, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_44|, ~x$w_buff1~0=v_~x$w_buff1~0_366, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_108|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_213, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_362, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_226, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_44|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_354, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_284, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_44|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_44|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_725, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_119, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_108|, ~y~0=v_~y~0_155} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~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, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1] 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 04:24:32,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [819] $Ultimate##0-->L816: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd2~0_333 256) 0))) (let ((.cse0 (not .cse5)) (.cse2 (not (= (mod v_~x$w_buff0_used~0_693 256) 0)))) (let ((.cse3 (and .cse0 .cse2)) (.cse1 (= (mod v_~x$w_buff0_used~0_694 256) 0)) (.cse4 (select |v_#memory_int_687| |v_~#x~0.base_332|))) (and (= v_~x$w_buff0~0_421 v_~x$w_buff1~0_350) (= v_~x$r_buff0_thd1~0_268 v_~x$r_buff1_thd1~0_187) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_693) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|) (= v_~x$r_buff0_thd0~0_249 v_~x$r_buff1_thd0~0_268) (= v_~x$r_buff0_thd3~0_206 v_~x$r_buff1_thd3~0_197) (= (ite .cse1 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|) (= v_~x$r_buff1_thd2~0_346 (ite (or (and (not (= 0 (mod v_~x$r_buff0_thd2~0_332 256))) .cse2) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_590 256) 0)))) 0 v_~x$r_buff0_thd2~0_333)) (= v_~x$w_buff0~0_420 1) (= v_~x$r_buff0_thd2~0_332 (ite .cse3 0 v_~x$r_buff0_thd2~0_333)) (= v_~x$w_buff1_used~0_590 (ite (or .cse3 (and (not .cse1) .cse0)) 0 v_~x$w_buff0_used~0_694)) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_28| |v_P0Thread1of1ForFork2_~arg#1.base_28|) (= v_~y~0_137 v_~__unbuffered_p0_EAX~0_103) (= v_~x$r_buff0_thd1~0_267 1) (or (and (= (select .cse4 |v_~#x~0.offset_332|) |v_P1_#t~mem22_72|) (= |v_P1_#t~ite23_67| |v_P1_#t~ite24_61|) .cse5 (= |v_P1_#t~ite23_67| |v_P1_#t~mem22_72|)) (and (= |v_P1_#t~ite24_61| v_~x$w_buff0~0_420) (= |v_P1_#t~ite23_67| |v_P1Thread1of1ForFork0_#t~ite23_66|) .cse0 (= |v_P1Thread1of1ForFork0_#t~mem22_66| |v_P1_#t~mem22_72|))) (= (store |v_#memory_int_687| |v_~#x~0.base_332| (store .cse4 |v_~#x~0.offset_332| |v_P1_#t~ite24_61|)) |v_#memory_int_686|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_28| |v_P0Thread1of1ForFork2_~arg#1.offset_28|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_421, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_66|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_249, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_268, ~#x~0.offset=|v_~#x~0.offset_332|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_28|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_206, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_66|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_28|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_333, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_694, #memory_int=|v_#memory_int_687|, ~#x~0.base=|v_~#x~0.base_332|, ~y~0=v_~y~0_137} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_420, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_267, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_35|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_197, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_206, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_28|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_28|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_103, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|, ~y~0=v_~y~0_137, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_249, ~#x~0.offset=|v_~#x~0.offset_332|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_28|, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_346, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_590, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_332, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_693, #memory_int=|v_#memory_int_686|, ~#x~0.base=|v_~#x~0.base_332|} AuxVars[|v_P1_#t~ite23_67|, |v_P1_#t~mem22_72|, |v_P1_#t~ite24_61|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, ~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, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [661] L773-->L780: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_215 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_214 256) 0))) (.cse5 (not .cse10))) (let ((.cse3 (and .cse0 .cse5)) (.cse2 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (select |v_#memory_int_182| |v_~#x~0.base_124|)) (.cse4 (not .cse11))) (and (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_37)) (= v_~x$w_buff1_used~0_191 (ite (or (and .cse2 .cse1) .cse3) 0 v_~x$w_buff1_used~0_192)) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_215) v_~x$w_buff0_used~0_214) (= (store |v_#memory_int_182| |v_~#x~0.base_124| (store .cse6 |v_~#x~0.offset_124| |v_P0_#t~ite5#1_29|)) |v_#memory_int_181|) (= v_~x$r_buff0_thd1~0_41 (ite .cse3 0 v_~x$r_buff0_thd1~0_42)) (let ((.cse7 (= |v_P0_#t~mem3#1_28| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and .cse7 .cse2 .cse1 (= |v_P0_#t~ite4#1_31| v_~x$w_buff1~0_77)) (and (= |v_P0_#t~mem3#1_28| |v_P0_#t~ite4#1_31|) (= |v_P0_#t~mem3#1_28| (select .cse6 |v_~#x~0.offset_124|)) (or .cse8 .cse9))) (or .cse10 .cse11) (= |v_P0_#t~ite4#1_31| |v_P0_#t~ite5#1_29|)) (and .cse7 (= |v_P0_#t~ite4#1_31| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse4 (= |v_P0_#t~ite5#1_29| v_~x$w_buff0~0_86) .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_181|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_214} AuxVars[|v_P0_#t~ite5#1_29|, |v_P0_#t~ite4#1_31|, |v_P0_#t~mem3#1_28|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-06 04:24:33,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [834] $Ultimate##0-->L816: Formula: (let ((.cse1 (= (mod v_~x$r_buff0_thd2~0_359 256) 0))) (let ((.cse5 (not (= (mod v_~x$w_buff0_used~0_753 256) 0))) (.cse0 (not .cse1))) (let ((.cse4 (= (mod v_~x$w_buff0_used~0_755 256) 0)) (.cse2 (select |v_#memory_int_743| |v_~#x~0.base_360|)) (.cse3 (and .cse5 .cse0))) (and (= v_~y~0_171 v_~__unbuffered_p0_EAX~0_131) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_48| |v_P0Thread1of1ForFork2_~arg#1.offset_48|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_112| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_112|) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_753) (or (and (= |v_P1_#t~ite23_78| |v_P1Thread1of1ForFork0_#t~ite23_78|) (= |v_P1_#t~ite24_72| v_~x$w_buff0~0_470) (= |v_P1Thread1of1ForFork0_#t~mem22_78| |v_P1_#t~mem22_83|) .cse0) (and (= |v_P1_#t~ite23_78| |v_P1_#t~ite24_72|) .cse1 (= (select .cse2 |v_~#x~0.offset_360|) |v_P1_#t~mem22_83|) (= |v_P1_#t~ite23_78| |v_P1_#t~mem22_83|))) (= (ite (or .cse3 (and (not .cse4) .cse0)) 0 v_~x$w_buff0_used~0_755) v_~x$w_buff1_used~0_630) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_112| (ite .cse4 1 0)) (= v_~x$r_buff0_thd0~0_289 v_~x$r_buff1_thd0~0_304) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_48| |v_P0Thread1of1ForFork2_~arg#1.base_48|) (= v_~x$w_buff0~0_470 1) (= (store |v_#memory_int_743| |v_~#x~0.base_360| (store .cse2 |v_~#x~0.offset_360| |v_P1_#t~ite24_72|)) |v_#memory_int_742|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_112| 0)) (= v_~x$r_buff1_thd2~0_366 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_630 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd2~0_358 256) 0)) .cse5)) 0 v_~x$r_buff0_thd2~0_359)) (= v_~x$r_buff0_thd3~0_234 v_~x$r_buff1_thd3~0_221) (= v_~x$r_buff0_thd1~0_308 v_~x$r_buff1_thd1~0_207) (= v_~x$r_buff0_thd1~0_307 1) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_359) v_~x$r_buff0_thd2~0_358) (= v_~x$w_buff0~0_471 v_~x$w_buff1~0_380))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_471, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_78|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_289, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_308, ~#x~0.offset=|v_~#x~0.offset_360|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_48|, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_78|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_234, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_48|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_755, #memory_int=|v_#memory_int_743|, ~#x~0.base=|v_~#x~0.base_360|, ~y~0=v_~y~0_171} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_470, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_307, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_41|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_112|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_221, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_207, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_234, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_48|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_48|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_131, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_112|, ~y~0=v_~y~0_171, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_289, ~#x~0.offset=|v_~#x~0.offset_360|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_48|, ~x$w_buff1~0=v_~x$w_buff1~0_380, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_366, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_630, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_358, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_304, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_48|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_753, #memory_int=|v_#memory_int_742|, ~#x~0.base=|v_~#x~0.base_360|} AuxVars[|v_P1_#t~ite23_78|, |v_P1_#t~mem22_83|, |v_P1_#t~ite24_72|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, ~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, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [661] L773-->L780: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_215 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_214 256) 0))) (.cse5 (not .cse10))) (let ((.cse3 (and .cse0 .cse5)) (.cse2 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (select |v_#memory_int_182| |v_~#x~0.base_124|)) (.cse4 (not .cse11))) (and (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_37)) (= v_~x$w_buff1_used~0_191 (ite (or (and .cse2 .cse1) .cse3) 0 v_~x$w_buff1_used~0_192)) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_215) v_~x$w_buff0_used~0_214) (= (store |v_#memory_int_182| |v_~#x~0.base_124| (store .cse6 |v_~#x~0.offset_124| |v_P0_#t~ite5#1_29|)) |v_#memory_int_181|) (= v_~x$r_buff0_thd1~0_41 (ite .cse3 0 v_~x$r_buff0_thd1~0_42)) (let ((.cse7 (= |v_P0_#t~mem3#1_28| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and .cse7 .cse2 .cse1 (= |v_P0_#t~ite4#1_31| v_~x$w_buff1~0_77)) (and (= |v_P0_#t~mem3#1_28| |v_P0_#t~ite4#1_31|) (= |v_P0_#t~mem3#1_28| (select .cse6 |v_~#x~0.offset_124|)) (or .cse8 .cse9))) (or .cse10 .cse11) (= |v_P0_#t~ite4#1_31| |v_P0_#t~ite5#1_29|)) (and .cse7 (= |v_P0_#t~ite4#1_31| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse4 (= |v_P0_#t~ite5#1_29| v_~x$w_buff0~0_86) .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_181|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_214} AuxVars[|v_P0_#t~ite5#1_29|, |v_P0_#t~ite4#1_31|, |v_P0_#t~mem3#1_28|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-06 04:24:34,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->L836: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_239 256) 0))) (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_765 256) 0))) (.cse1 (not .cse5))) (let ((.cse0 (= (mod v_~x$w_buff0_used~0_767 256) 0)) (.cse3 (select |v_#memory_int_751| |v_~#x~0.base_364|)) (.cse2 (and .cse4 .cse1))) (and (= v_~x$w_buff0~0_478 1) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_52| |v_P0Thread1of1ForFork2_~arg#1.base_52|) (= v_~x$r_buff0_thd1~0_318 v_~x$r_buff1_thd1~0_213) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_52| |v_P0Thread1of1ForFork2_~arg#1.offset_52|) (= v_~x$w_buff1_used~0_638 (ite (or (and (not .cse0) .cse1) .cse2) 0 v_~x$w_buff0_used~0_767)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_116| 0)) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_765) (= (store |v_#memory_int_751| |v_~#x~0.base_364| (store .cse3 |v_~#x~0.offset_364| |v_P2_#t~ite27_74|)) |v_#memory_int_750|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_116| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_116|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_638 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd3~0_238 256) 0)) .cse4)) 0 v_~x$r_buff0_thd3~0_239) v_~x$r_buff1_thd3~0_225) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_116| (ite .cse0 1 0)) (= v_~x$r_buff0_thd2~0_364 v_~x$r_buff1_thd2~0_372) (= v_~x$w_buff0~0_479 v_~x$w_buff1~0_384) (= v_~x$r_buff0_thd1~0_317 1) (or (and (= |v_P2_#t~ite26_80| |v_P2_#t~mem25_83|) .cse5 (= |v_P2_#t~mem25_83| (select .cse3 |v_~#x~0.offset_364|)) (= |v_P2_#t~ite26_80| |v_P2_#t~ite27_74|)) (and (= |v_P2_#t~ite26_80| |v_P2Thread1of1ForFork1_#t~ite26_92|) (= |v_P2_#t~ite27_74| v_~x$w_buff0~0_478) .cse1 (= |v_P2Thread1of1ForFork1_#t~mem25_92| |v_P2_#t~mem25_83|))) (= v_~x$r_buff0_thd0~0_293 v_~x$r_buff1_thd0~0_308) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_239) v_~x$r_buff0_thd3~0_238) (= v_~y~0_175 v_~__unbuffered_p0_EAX~0_135))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_479, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_293, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_318, ~#x~0.offset=|v_~#x~0.offset_364|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_92|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_52|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_239, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_52|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_364, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_767, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_92|, #memory_int=|v_#memory_int_751|, ~#x~0.base=|v_~#x~0.base_364|, ~y~0=v_~y~0_175} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_478, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_317, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_225, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_116|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_213, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_238, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_52|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_48|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_116|, ~y~0=v_~y~0_175, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_293, ~#x~0.offset=|v_~#x~0.offset_364|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_52|, ~x$w_buff1~0=v_~x$w_buff1~0_384, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_638, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_372, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_364, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_308, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_52|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_765, #memory_int=|v_#memory_int_750|, ~#x~0.base=|v_~#x~0.base_364|} AuxVars[|v_P2_#t~mem25_83|, |v_P2_#t~ite27_74|, |v_P2_#t~ite26_80|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, 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, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [661] L773-->L780: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_42 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_215 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_214 256) 0))) (.cse5 (not .cse10))) (let ((.cse3 (and .cse0 .cse5)) (.cse2 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (select |v_#memory_int_182| |v_~#x~0.base_124|)) (.cse4 (not .cse11))) (and (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_41 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse1)) 0 v_~x$r_buff1_thd1~0_37)) (= v_~x$w_buff1_used~0_191 (ite (or (and .cse2 .cse1) .cse3) 0 v_~x$w_buff1_used~0_192)) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_215) v_~x$w_buff0_used~0_214) (= (store |v_#memory_int_182| |v_~#x~0.base_124| (store .cse6 |v_~#x~0.offset_124| |v_P0_#t~ite5#1_29|)) |v_#memory_int_181|) (= v_~x$r_buff0_thd1~0_41 (ite .cse3 0 v_~x$r_buff0_thd1~0_42)) (let ((.cse7 (= |v_P0_#t~mem3#1_28| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and .cse7 .cse2 .cse1 (= |v_P0_#t~ite4#1_31| v_~x$w_buff1~0_77)) (and (= |v_P0_#t~mem3#1_28| |v_P0_#t~ite4#1_31|) (= |v_P0_#t~mem3#1_28| (select .cse6 |v_~#x~0.offset_124|)) (or .cse8 .cse9))) (or .cse10 .cse11) (= |v_P0_#t~ite4#1_31| |v_P0_#t~ite5#1_29|)) (and .cse7 (= |v_P0_#t~ite4#1_31| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse4 (= |v_P0_#t~ite5#1_29| v_~x$w_buff0~0_86) .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_42, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_182|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_86, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~#x~0.offset=|v_~#x~0.offset_124|, ~x$w_buff1~0=v_~x$w_buff1~0_77, #memory_int=|v_#memory_int_181|, ~#x~0.base=|v_~#x~0.base_124|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_214} AuxVars[|v_P0_#t~ite5#1_29|, |v_P0_#t~ite4#1_31|, |v_P0_#t~mem3#1_28|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-06 04:24:35,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L829: Formula: (and (= v_~y~0_120 v_~__unbuffered_p2_EAX~0_108) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~y~0_119 2) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_120} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_119} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [839] $Ultimate##0-->L780: Formula: (let ((.cse8 (= (mod v_~x$r_buff0_thd3~0_247 256) 0))) (let ((.cse1 (not .cse8))) (let ((.cse4 (ite .cse1 0 1))) (let ((.cse10 (= (mod .cse4 256) 0))) (let ((.cse3 (not .cse10))) (let ((.cse11 (and .cse1 .cse3)) (.cse9 (= (mod v_~x$w_buff0_used~0_785 256) 0))) (let ((.cse6 (ite (or .cse11 (and .cse1 (not .cse9))) 0 v_~x$w_buff0_used~0_785))) (let ((.cse2 (not (= (mod .cse6 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_335 256) 0))) (.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_783 256)))) (.cse7 (select |v_#memory_int_768| |v_~#x~0.base_370|))) (and (= (ite .cse0 0 1) v_~x$r_buff0_thd1~0_333) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_58| |v_P0Thread1of1ForFork2_~arg#1.base_58|) (= v_~x$r_buff0_thd2~0_374 v_~x$r_buff1_thd2~0_378) (= (ite (or (and .cse1 .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_246 256) 0)) .cse3)) 0 v_~x$r_buff0_thd3~0_247) v_~x$r_buff1_thd3~0_233) (= (ite .cse3 0 .cse4) v_~x$w_buff0_used~0_783) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_122| 0)) (= v_~x$w_buff1_used~0_650 (ite (or (and .cse2 .cse5) .cse0) 0 .cse6)) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_122| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_122|) (= v_~x$r_buff1_thd1~0_223 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_650 256) 0)) .cse5) (and (not (= (mod v_~x$r_buff0_thd1~0_333 256) 0)) .cse0)) 0 v_~x$r_buff0_thd1~0_335)) (= (store |v_#memory_int_768| |v_~#x~0.base_370| (store .cse7 |v_~#x~0.offset_370| |v_P0_#t~ite5#1_73|)) |v_#memory_int_766|) (= v_~y~0_181 v_~__unbuffered_p0_EAX~0_141) (or (and .cse1 (= |v_P2Thread1of1ForFork1_#t~mem25_96| |v_P2_#t~mem25_85|) (= |v_P2_#t~ite26_82| |v_P2Thread1of1ForFork1_#t~ite26_96|) (= |v_P2_#t~ite27_76| v_~x$w_buff0~0_490)) (and .cse8 (= (select .cse7 |v_~#x~0.offset_370|) |v_P2_#t~mem25_85|) (= |v_P2_#t~ite26_82| |v_P2_#t~mem25_85|) (= |v_P2_#t~ite26_82| |v_P2_#t~ite27_76|))) (= v_~x$w_buff0~0_490 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_122| (ite .cse9 1 0)) (= v_~x$w_buff0~0_491 v_~x$w_buff1~0_390) (or (and (= |v_P0_#t~mem3#1_72| |v_P0Thread1of1ForFork2_#t~mem3#1_86|) (= |v_P0_#t~ite5#1_73| v_~x$w_buff0~0_490) .cse3 (= |v_P0_#t~ite4#1_75| |v_P0Thread1of1ForFork2_#t~ite4#1_86|)) (and (= |v_P0_#t~ite4#1_75| |v_P0_#t~ite5#1_73|) (= |v_P0_#t~mem3#1_72| |v_P0_#t~ite4#1_75|) .cse10 (= |v_P0_#t~mem3#1_72| |v_P2_#t~ite27_76|))) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_58| |v_P0Thread1of1ForFork2_~arg#1.offset_58|) (= v_~x$r_buff0_thd0~0_299 v_~x$r_buff1_thd0~0_314) (= (ite .cse11 0 v_~x$r_buff0_thd3~0_247) v_~x$r_buff0_thd3~0_246)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_491, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_299, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_335, ~#x~0.offset=|v_~#x~0.offset_370|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_58|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_96|, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_86|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_247, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_58|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_374, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_86|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_785, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_96|, #memory_int=|v_#memory_int_768|, ~#x~0.base=|v_~#x~0.base_370|, ~y~0=v_~y~0_181} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_490, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_333, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_233, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_122|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_223, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_246, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_58|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_58|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_141, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_50|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_122|, ~y~0=v_~y~0_181, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_299, ~#x~0.offset=|v_~#x~0.offset_370|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_58|, ~x$w_buff1~0=v_~x$w_buff1~0_390, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_650, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_378, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_374, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_58|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_783, #memory_int=|v_#memory_int_766|, ~#x~0.base=|v_~#x~0.base_370|, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_51|} AuxVars[|v_P0_#t~ite4#1_75|, |v_P2_#t~mem25_85|, |v_P0_#t~mem3#1_72|, |v_P0_#t~ite5#1_73|, |v_P2_#t~ite26_82|, |v_P2_#t~ite27_76|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, 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, P0Thread1of1ForFork2_#t~mem3#1, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_#t~ite4#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int, P0Thread1of1ForFork2_#t~ite5#1] [2022-12-06 04:24:35,677 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:24:35,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5678 [2022-12-06 04:24:35,678 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 269 flow [2022-12-06 04:24:35,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:24:35,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:24:35,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:35,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:24:35,679 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 04:24:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:24:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1556458883, now seen corresponding path program 1 times [2022-12-06 04:24:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:24:35,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375881196] [2022-12-06 04:24:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:24:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:24:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:24:35,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:24:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:24:35,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:24:35,813 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:24:35,813 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:24:35,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:24:35,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:24:35,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:24:35,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:24:35,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:24:35,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:24:35,816 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:24:35,820 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:24:35,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:24:35,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:24:35 BasicIcfg [2022-12-06 04:24:35,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:24:35,869 INFO L158 Benchmark]: Toolchain (without parser) took 40110.76ms. Allocated memory was 182.5MB in the beginning and 671.1MB in the end (delta: 488.6MB). Free memory was 155.0MB in the beginning and 263.1MB in the end (delta: -108.2MB). Peak memory consumption was 379.8MB. Max. memory is 8.0GB. [2022-12-06 04:24:35,869 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.9MB in the beginning and 105.8MB in the end (delta: 33.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:24:35,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.88ms. Allocated memory is still 182.5MB. Free memory was 154.6MB in the beginning and 155.4MB in the end (delta: -765.8kB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. [2022-12-06 04:24:35,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.44ms. Allocated memory is still 182.5MB. Free memory was 155.4MB in the beginning and 152.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:24:35,870 INFO L158 Benchmark]: Boogie Preprocessor took 54.05ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:24:35,870 INFO L158 Benchmark]: RCFGBuilder took 876.01ms. Allocated memory is still 182.5MB. Free memory was 150.2MB in the beginning and 117.0MB in the end (delta: 33.1MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. [2022-12-06 04:24:35,870 INFO L158 Benchmark]: TraceAbstraction took 38627.43ms. Allocated memory was 182.5MB in the beginning and 671.1MB in the end (delta: 488.6MB). Free memory was 116.0MB in the beginning and 263.1MB in the end (delta: -147.1MB). Peak memory consumption was 341.0MB. Max. memory is 8.0GB. [2022-12-06 04:24:35,871 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.9MB in the beginning and 105.8MB in the end (delta: 33.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 477.88ms. Allocated memory is still 182.5MB. Free memory was 154.6MB in the beginning and 155.4MB in the end (delta: -765.8kB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.44ms. Allocated memory is still 182.5MB. Free memory was 155.4MB in the beginning and 152.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.05ms. Allocated memory is still 182.5MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 876.01ms. Allocated memory is still 182.5MB. Free memory was 150.2MB in the beginning and 117.0MB in the end (delta: 33.1MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. * TraceAbstraction took 38627.43ms. Allocated memory was 182.5MB in the beginning and 671.1MB in the end (delta: 488.6MB). Free memory was 116.0MB in the beginning and 263.1MB in the end (delta: -147.1MB). Peak memory consumption was 341.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 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: 1484, independent: 1424, independent conditional: 1424, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1484, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1484, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1484, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1214, independent: 1173, independent conditional: 0, independent unconditional: 1173, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1214, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 390, dependent conditional: 0, dependent unconditional: 390, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1484, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1214, unknown conditional: 0, unknown unconditional: 1214] , Statistics on independence cache: Total cache size (in pairs): 1845, Positive cache size: 1804, Positive conditional cache size: 0, Positive unconditional cache size: 1804, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 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: 74, independent: 52, independent conditional: 52, 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: 74, independent: 52, independent conditional: 8, independent unconditional: 44, 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: 74, independent: 52, independent conditional: 8, independent unconditional: 44, 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: 74, independent: 52, independent conditional: 8, independent unconditional: 44, 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: 66, independent: 49, independent conditional: 8, independent unconditional: 41, 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: 66, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 119, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 113, dependent conditional: 37, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 66, unknown conditional: 12, unknown unconditional: 54] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 49, Positive conditional cache size: 8, Positive unconditional cache size: 41, 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: 65, independent: 45, independent conditional: 45, 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: 65, independent: 45, independent conditional: 2, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 11, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 56, Positive conditional cache size: 8, Positive unconditional cache size: 48, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 94, independent conditional: 14, independent unconditional: 80, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 11, unknown conditional: 1, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 64, Positive conditional cache size: 8, Positive unconditional cache size: 56, Negative cache size: 25, Negative conditional cache size: 5, 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.0s, 38 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 55, independent: 37, independent conditional: 7, independent unconditional: 30, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 55, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 70, Positive conditional cache size: 8, Positive unconditional cache size: 62, Negative cache size: 25, Negative conditional cache size: 5, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 41 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 152, independent conditional: 77, independent unconditional: 75, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 152, independent conditional: 77, independent unconditional: 75, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 152, independent conditional: 77, independent unconditional: 75, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, independent: 132, independent conditional: 57, independent unconditional: 75, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 99, Positive conditional cache size: 28, Positive unconditional cache size: 71, Negative cache size: 25, Negative conditional cache size: 5, Negative unconditional cache size: 20, 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: 3.6s, 44 PlacesBefore, 43 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 59, independent conditional: 37, independent unconditional: 22, dependent: 21, dependent conditional: 7, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 59, independent conditional: 8, independent unconditional: 51, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 59, independent conditional: 8, independent unconditional: 51, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 54, independent conditional: 4, independent unconditional: 50, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 108, Positive conditional cache size: 32, Positive unconditional cache size: 76, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 43 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 108, independent conditional: 66, independent unconditional: 42, dependent: 36, dependent conditional: 22, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 108, independent conditional: 50, independent unconditional: 58, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 108, independent conditional: 50, independent unconditional: 58, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 7, independent unconditional: 8, 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: 15, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 93, independent conditional: 43, independent unconditional: 50, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 15, unknown conditional: 7, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 140, Positive conditional cache size: 40, Positive unconditional cache size: 100, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, independent: 177, independent conditional: 177, 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: 199, independent: 177, independent conditional: 119, independent unconditional: 58, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, independent: 177, independent conditional: 16, independent unconditional: 161, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, independent: 177, independent conditional: 16, independent unconditional: 161, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 199, independent: 171, independent conditional: 16, independent unconditional: 155, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 170, Positive conditional cache size: 40, Positive unconditional cache size: 130, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 103, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 149, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 149, independent: 123, independent conditional: 67, independent unconditional: 56, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 149, independent: 123, independent conditional: 24, independent unconditional: 99, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 149, independent: 123, independent conditional: 24, independent unconditional: 99, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, independent: 122, independent conditional: 24, independent unconditional: 98, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 177, Positive conditional cache size: 40, Positive unconditional cache size: 137, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 178, Positive conditional cache size: 40, Positive unconditional cache size: 138, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, 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: 1.5s, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 6, independent unconditional: 9, 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: 15, independent: 15, independent conditional: 2, independent unconditional: 13, 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: 15, independent: 15, independent conditional: 2, independent unconditional: 13, 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: 15, independent: 11, independent conditional: 2, independent unconditional: 9, 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): 218, Positive cache size: 189, Positive conditional cache size: 40, Positive unconditional cache size: 149, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 45 PlacesBefore, 42 PlacesAfterwards, 37 TransitionsBefore, 34 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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: 25, independent: 25, independent conditional: 25, 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): 241, Positive cache size: 212, Positive conditional cache size: 40, Positive unconditional cache size: 172, Negative cache size: 29, Negative conditional cache size: 5, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1780, ((void *)0), P0, ((void *)0))=-1, t1780={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] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1781, ((void *)0), P1, ((void *)0))=0, t1780={7:0}, t1781={8: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] [L857] 0 pthread_t t1782; [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_p0_EAX=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=0, 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] [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1782, ((void *)0), P2, ((void *)0))=1, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, 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] [L825] 3 __unbuffered_p2_EAX = y [L828] 3 y = 2 [L760] 3 __unbuffered_p0_EAX = y [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 [L775] EXPR 3 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 3 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] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 3 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] 3 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 3 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_p0_EAX=2, __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=0, 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=2] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 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 = !(y == 2 && __unbuffered_p0_EAX == 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_p0_EAX=2, __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=0, weak$$choice1=1, 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=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: 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: 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: 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: 38.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 4 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1224 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 04:24:35,907 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...