/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:52:51,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:52:51,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:52:51,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:52:51,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:52:51,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:52:51,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:52:51,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:52:51,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:52:51,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:52:51,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:52:51,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:52:51,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:52:51,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:52:51,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:52:51,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:52:51,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:52:51,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:52:51,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:52:51,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:52:51,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:52:51,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:52:51,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:52:51,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:52:51,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:52:51,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:52:51,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:52:51,991 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:52:51,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:52:51,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:52:51,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:52:51,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:52:51,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:52:51,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:52:51,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:52:51,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:52:51,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:52:51,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:52:51,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:52:51,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:52:51,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:52:52,003 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-NoLbe.epf [2022-12-12 11:52:52,035 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:52:52,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:52:52,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:52:52,036 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:52:52,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:52:52,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:52:52,038 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:52:52,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:52:52,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:52:52,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:52:52,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:52:52,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:52:52,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:52:52,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:52:52,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:52:52,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:52:52,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:52:52,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:52:52,040 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:52:52,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:52:52,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:52:52,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:52:52,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:52:52,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:52:52,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:52:52,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:52:52,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:52:52,042 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:52:52,042 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:52:52,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:52:52,042 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:52:52,042 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:52:52,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:52:52,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:52:52,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:52:52,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:52:52,354 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:52:52,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2022-12-12 11:52:53,496 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:52:53,760 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:52:53,760 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2022-12-12 11:52:53,778 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878436d3c/a55f3d6f8f734f74a9632cce43083bd3/FLAG67f078793 [2022-12-12 11:52:53,796 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878436d3c/a55f3d6f8f734f74a9632cce43083bd3 [2022-12-12 11:52:53,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:52:53,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:52:53,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:52:53,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:52:53,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:52:53,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:52:53" (1/1) ... [2022-12-12 11:52:53,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3777da21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:53, skipping insertion in model container [2022-12-12 11:52:53,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:52:53" (1/1) ... [2022-12-12 11:52:53,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:52:53,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:52:54,038 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/mix032.oepc.i[945,958] [2022-12-12 11:52:54,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:52:54,259 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:52:54,269 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/mix032.oepc.i[945,958] [2022-12-12 11:52:54,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 11:52:54,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 11:52:54,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:52:54,383 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:52:54,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54 WrapperNode [2022-12-12 11:52:54,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:52:54,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:52:54,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:52:54,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:52:54,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,439 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-12 11:52:54,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:52:54,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:52:54,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:52:54,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:52:54,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:52:54,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:52:54,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:52:54,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:52:54,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (1/1) ... [2022-12-12 11:52:54,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:52:54,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:52:54,528 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-12 11:52:54,535 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-12 11:52:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:52:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 11:52:54,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 11:52:54,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 11:52:54,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 11:52:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:52:54,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:52:54,561 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:52:54,686 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:52:54,688 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:52:55,035 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:52:55,158 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:52:55,158 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 11:52:55,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:52:55 BoogieIcfgContainer [2022-12-12 11:52:55,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:52:55,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:52:55,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:52:55,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:52:55,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:52:53" (1/3) ... [2022-12-12 11:52:55,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae06275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:52:55, skipping insertion in model container [2022-12-12 11:52:55,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:52:54" (2/3) ... [2022-12-12 11:52:55,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae06275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:52:55, skipping insertion in model container [2022-12-12 11:52:55,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:52:55" (3/3) ... [2022-12-12 11:52:55,168 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2022-12-12 11:52:55,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:52:55,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:52:55,186 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:52:55,239 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 11:52:55,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-12 11:52:55,342 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-12 11:52:55,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:52:55,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-12 11:52:55,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-12 11:52:55,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-12 11:52:55,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:52:55,372 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=PETRI_NET, 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;@547e1a4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:52:55,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 11:52:55,388 INFO L130 PetriNetUnfolder]: 0/47 cut-off events. [2022-12-12 11:52:55,389 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:52:55,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:52:55,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:52:55,393 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-12 11:52:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:52:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash 337010912, now seen corresponding path program 1 times [2022-12-12 11:52:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:52:55,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503487232] [2022-12-12 11:52:55,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:52:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:52:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:52:55,949 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-12 11:52:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:52:55,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503487232] [2022-12-12 11:52:55,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503487232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:52:55,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:52:55,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:52:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602465862] [2022-12-12 11:52:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:52:55,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:52:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:52:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:52:55,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:52:55,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 117 [2022-12-12 11:52:56,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-12 11:52:56,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:52:56,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 117 [2022-12-12 11:52:56,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:52:56,168 INFO L130 PetriNetUnfolder]: 58/278 cut-off events. [2022-12-12 11:52:56,168 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-12 11:52:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 278 events. 58/278 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1144 event pairs, 10 based on Foata normal form. 29/294 useless extension candidates. Maximal degree in co-relation 353. Up to 79 conditions per place. [2022-12-12 11:52:56,175 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 14 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-12-12 11:52:56,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 279 flow [2022-12-12 11:52:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:52:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:52:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-12-12 11:52:56,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-12-12 11:52:56,198 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2022-12-12 11:52:56,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 279 flow [2022-12-12 11:52:56,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 272 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-12 11:52:56,206 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 272 flow [2022-12-12 11:52:56,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-12 11:52:56,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:52:56,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:52:56,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:52:56,208 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-12 11:52:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:52:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1544551560, now seen corresponding path program 1 times [2022-12-12 11:52:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:52:56,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687156945] [2022-12-12 11:52:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:52:56,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:52:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:52:56,651 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-12 11:52:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:52:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687156945] [2022-12-12 11:52:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687156945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:52:56,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:52:56,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:52:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472854306] [2022-12-12 11:52:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:52:56,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:52:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:52:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:52:56,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:52:56,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-12-12 11:52:56,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-12 11:52:56,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:52:56,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-12-12 11:52:56,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:52:57,587 INFO L130 PetriNetUnfolder]: 1548/3804 cut-off events. [2022-12-12 11:52:57,588 INFO L131 PetriNetUnfolder]: For 799/1303 co-relation queries the response was YES. [2022-12-12 11:52:57,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7202 conditions, 3804 events. 1548/3804 cut-off events. For 799/1303 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 30496 event pairs, 538 based on Foata normal form. 0/3671 useless extension candidates. Maximal degree in co-relation 7144. Up to 1235 conditions per place. [2022-12-12 11:52:57,614 INFO L137 encePairwiseOnDemand]: 111/117 looper letters, 40 selfloop transitions, 2 changer transitions 79/197 dead transitions. [2022-12-12 11:52:57,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 197 transitions, 766 flow [2022-12-12 11:52:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:52:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:52:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2022-12-12 11:52:57,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8366571699905033 [2022-12-12 11:52:57,619 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 5 predicate places. [2022-12-12 11:52:57,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 197 transitions, 766 flow [2022-12-12 11:52:57,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 197 transitions, 754 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-12 11:52:57,629 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 197 transitions, 754 flow [2022-12-12 11:52:57,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-12 11:52:57,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:52:57,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:52:57,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:52:57,630 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-12 11:52:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:52:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1059269818, now seen corresponding path program 1 times [2022-12-12 11:52:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:52:57,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531055375] [2022-12-12 11:52:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:52:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:52:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:52:57,984 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-12 11:52:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:52:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531055375] [2022-12-12 11:52:57,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531055375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:52:57,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:52:57,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:52:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989533491] [2022-12-12 11:52:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:52:57,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:52:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:52:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:52:57,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:52:57,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-12-12 11:52:57,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 197 transitions, 754 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 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-12 11:52:57,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:52:57,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-12-12 11:52:57,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:52:58,948 INFO L130 PetriNetUnfolder]: 2330/5867 cut-off events. [2022-12-12 11:52:58,949 INFO L131 PetriNetUnfolder]: For 1344/2382 co-relation queries the response was YES. [2022-12-12 11:52:58,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14550 conditions, 5867 events. 2330/5867 cut-off events. For 1344/2382 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 52934 event pairs, 168 based on Foata normal form. 0/5783 useless extension candidates. Maximal degree in co-relation 14490. Up to 1712 conditions per place. [2022-12-12 11:52:58,977 INFO L137 encePairwiseOnDemand]: 109/117 looper letters, 51 selfloop transitions, 5 changer transitions 240/372 dead transitions. [2022-12-12 11:52:58,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 372 transitions, 2240 flow [2022-12-12 11:52:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:52:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:52:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 968 transitions. [2022-12-12 11:52:58,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8273504273504273 [2022-12-12 11:52:58,981 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 14 predicate places. [2022-12-12 11:52:58,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 372 transitions, 2240 flow [2022-12-12 11:52:58,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 372 transitions, 2230 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-12 11:52:58,990 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 372 transitions, 2230 flow [2022-12-12 11:52:58,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 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-12 11:52:58,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:52:58,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:52:58,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:52:58,992 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-12 11:52:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:52:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1671715576, now seen corresponding path program 1 times [2022-12-12 11:52:58,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:52:58,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137357311] [2022-12-12 11:52:58,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:52:58,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:52:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:52:59,223 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-12 11:52:59,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:52:59,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137357311] [2022-12-12 11:52:59,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137357311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:52:59,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:52:59,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 11:52:59,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858741187] [2022-12-12 11:52:59,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:52:59,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 11:52:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:52:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 11:52:59,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 11:52:59,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-12-12 11:52:59,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 372 transitions, 2230 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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-12 11:52:59,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:52:59,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-12-12 11:52:59,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:52:59,661 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][185], [106#L763true, 37#L799true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 58#L2true, P0Thread1of1ForFork1InUse, 174#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,661 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,661 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,662 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,662 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,662 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][164], [8#L831true, 106#L763true, 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 58#L2true, P0Thread1of1ForFork1InUse, 174#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse]) [2022-12-12 11:52:59,662 INFO L382 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,662 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,662 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,662 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-12 11:52:59,713 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][184], [106#L763true, 37#L799true, 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,713 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,713 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,714 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,714 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,714 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][163], [8#L831true, 106#L763true, 63#L792true, 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:52:59,714 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,714 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,714 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,714 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,715 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~b$r_buff1_thd1~0_16 256) 0))) (.cse3 (not (= 0 (mod v_~b$w_buff0_used~0_87 256)))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= 0 (mod v_~b$w_buff1_used~0_81 256))) .cse2)) (.cse4 (and (not (= (mod v_~b$w_buff0_used~0_88 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_81) v_~b$w_buff1_used~0_80) (= (ite .cse1 0 v_~b$r_buff0_thd1~0_25) v_~b$r_buff0_thd1~0_24) (= (ite (or (and .cse2 (not (= (mod v_~b$w_buff1_used~0_80 256) 0))) (and .cse3 (not (= (mod v_~b$r_buff0_thd1~0_24 256) 0)))) 0 v_~b$r_buff1_thd1~0_16) v_~b$r_buff1_thd1~0_15) (= v_~b~0_32 (ite .cse4 v_~b$w_buff0~0_35 (ite .cse0 v_~b$w_buff1~0_30 v_~b~0_33))) (= v_~b$w_buff0_used~0_87 (ite .cse4 0 v_~b$w_buff0_used~0_88))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_88, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_25, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_16, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_81, ~b~0=v_~b~0_33, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_87, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_24, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_80, ~b~0=v_~b~0_32, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0][182], [26#L773true, 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 58#L2true, P0Thread1of1ForFork1InUse, 174#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,715 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,715 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,715 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,715 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,716 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][185], [37#L799true, 99#L766true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 58#L2true, P0Thread1of1ForFork1InUse, 174#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,716 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,716 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,716 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,716 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,716 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][164], [8#L831true, 99#L766true, 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 58#L2true, P0Thread1of1ForFork1InUse, 174#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse]) [2022-12-12 11:52:59,716 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,717 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,717 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,717 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:52:59,761 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][184], [106#L763true, 114#L3-1true, 37#L799true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,761 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,762 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,762 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,762 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,762 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][163], [8#L831true, 106#L763true, 114#L3-1true, 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:52:59,762 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,762 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,762 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,763 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,763 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~b$r_buff1_thd1~0_16 256) 0))) (.cse3 (not (= 0 (mod v_~b$w_buff0_used~0_87 256)))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= 0 (mod v_~b$w_buff1_used~0_81 256))) .cse2)) (.cse4 (and (not (= (mod v_~b$w_buff0_used~0_88 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_81) v_~b$w_buff1_used~0_80) (= (ite .cse1 0 v_~b$r_buff0_thd1~0_25) v_~b$r_buff0_thd1~0_24) (= (ite (or (and .cse2 (not (= (mod v_~b$w_buff1_used~0_80 256) 0))) (and .cse3 (not (= (mod v_~b$r_buff0_thd1~0_24 256) 0)))) 0 v_~b$r_buff1_thd1~0_16) v_~b$r_buff1_thd1~0_15) (= v_~b~0_32 (ite .cse4 v_~b$w_buff0~0_35 (ite .cse0 v_~b$w_buff1~0_30 v_~b~0_33))) (= v_~b$w_buff0_used~0_87 (ite .cse4 0 v_~b$w_buff0_used~0_88))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_88, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_25, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_16, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_81, ~b~0=v_~b~0_33, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_87, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_24, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_80, ~b~0=v_~b~0_32, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0][181], [26#L773true, 63#L792true, 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,763 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,763 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,763 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,763 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,764 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][184], [99#L766true, 37#L799true, 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,764 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,764 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,764 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,764 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,764 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][163], [8#L831true, 99#L766true, 63#L792true, 128#true, 131#true, 46#L3true, 148#true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:52:59,765 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,765 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,765 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,765 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:52:59,842 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~b$r_buff1_thd1~0_16 256) 0))) (.cse3 (not (= 0 (mod v_~b$w_buff0_used~0_87 256)))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= 0 (mod v_~b$w_buff1_used~0_81 256))) .cse2)) (.cse4 (and (not (= (mod v_~b$w_buff0_used~0_88 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_81) v_~b$w_buff1_used~0_80) (= (ite .cse1 0 v_~b$r_buff0_thd1~0_25) v_~b$r_buff0_thd1~0_24) (= (ite (or (and .cse2 (not (= (mod v_~b$w_buff1_used~0_80 256) 0))) (and .cse3 (not (= (mod v_~b$r_buff0_thd1~0_24 256) 0)))) 0 v_~b$r_buff1_thd1~0_16) v_~b$r_buff1_thd1~0_15) (= v_~b~0_32 (ite .cse4 v_~b$w_buff0~0_35 (ite .cse0 v_~b$w_buff1~0_30 v_~b~0_33))) (= v_~b$w_buff0_used~0_87 (ite .cse4 0 v_~b$w_buff0_used~0_88))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_88, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_25, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_16, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_81, ~b~0=v_~b~0_33, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_87, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_24, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_80, ~b~0=v_~b~0_32, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0][181], [26#L773true, 114#L3-1true, 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,843 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,843 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,843 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,843 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,843 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][184], [114#L3-1true, 99#L766true, 37#L799true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:52:59,843 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,844 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,844 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,844 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,845 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][163], [8#L831true, 114#L3-1true, 99#L766true, 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, 176#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:52:59,845 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,846 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,846 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:52:59,846 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:00,343 INFO L130 PetriNetUnfolder]: 2910/6639 cut-off events. [2022-12-12 11:53:00,343 INFO L131 PetriNetUnfolder]: For 8454/9550 co-relation queries the response was YES. [2022-12-12 11:53:00,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18997 conditions, 6639 events. 2910/6639 cut-off events. For 8454/9550 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 56406 event pairs, 90 based on Foata normal form. 42/6373 useless extension candidates. Maximal degree in co-relation 18938. Up to 2457 conditions per place. [2022-12-12 11:53:00,393 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 195 selfloop transitions, 17 changer transitions 95/448 dead transitions. [2022-12-12 11:53:00,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 448 transitions, 3234 flow [2022-12-12 11:53:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:53:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:53:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1019 transitions. [2022-12-12 11:53:00,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.870940170940171 [2022-12-12 11:53:00,398 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 22 predicate places. [2022-12-12 11:53:00,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 448 transitions, 3234 flow [2022-12-12 11:53:00,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 448 transitions, 3230 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 11:53:00,412 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 448 transitions, 3230 flow [2022-12-12 11:53:00,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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-12 11:53:00,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:00,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:00,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:53:00,413 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-12 11:53:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 856436254, now seen corresponding path program 1 times [2022-12-12 11:53:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831781098] [2022-12-12 11:53:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:00,626 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-12 11:53:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831781098] [2022-12-12 11:53:00,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831781098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:00,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:00,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-12 11:53:00,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420903728] [2022-12-12 11:53:00,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:00,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 11:53:00,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:00,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 11:53:00,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-12 11:53:00,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-12-12 11:53:00,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 448 transitions, 3230 flow. Second operand has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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-12 11:53:00,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:00,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-12-12 11:53:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:01,587 INFO L130 PetriNetUnfolder]: 1910/4024 cut-off events. [2022-12-12 11:53:01,587 INFO L131 PetriNetUnfolder]: For 8054/10541 co-relation queries the response was YES. [2022-12-12 11:53:01,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14588 conditions, 4024 events. 1910/4024 cut-off events. For 8054/10541 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 30084 event pairs, 63 based on Foata normal form. 427/4290 useless extension candidates. Maximal degree in co-relation 14527. Up to 1465 conditions per place. [2022-12-12 11:53:01,677 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 179 selfloop transitions, 40 changer transitions 130/445 dead transitions. [2022-12-12 11:53:01,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 445 transitions, 3782 flow [2022-12-12 11:53:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:53:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:53:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1328 transitions. [2022-12-12 11:53:01,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8731097961867192 [2022-12-12 11:53:01,682 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 33 predicate places. [2022-12-12 11:53:01,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 445 transitions, 3782 flow [2022-12-12 11:53:01,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 445 transitions, 3474 flow, removed 146 selfloop flow, removed 4 redundant places. [2022-12-12 11:53:01,693 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 445 transitions, 3474 flow [2022-12-12 11:53:01,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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-12 11:53:01,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:01,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:01,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 11:53:01,694 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-12 11:53:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1018075721, now seen corresponding path program 1 times [2022-12-12 11:53:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738725946] [2022-12-12 11:53:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:02,008 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-12 11:53:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:02,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738725946] [2022-12-12 11:53:02,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738725946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:02,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:02,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 11:53:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231249076] [2022-12-12 11:53:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:02,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 11:53:02,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 11:53:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 11:53:02,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 117 [2022-12-12 11:53:02,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 445 transitions, 3474 flow. Second operand has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 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-12 11:53:02,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:02,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 117 [2022-12-12 11:53:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:02,510 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][188], [106#L763true, 37#L799true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:53:02,510 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,511 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,511 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,511 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,511 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][168], [8#L831true, 106#L763true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L792true, 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:53:02,511 INFO L382 tUnfolder$Statistics]: this new event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,511 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,511 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,512 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-12 11:53:02,609 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][188], [106#L763true, 114#L3-1true, 37#L799true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:53:02,609 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,609 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,609 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,609 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,610 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][168], [8#L831true, 106#L763true, 114#L3-1true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L792true, 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:53:02,610 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,610 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,610 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,610 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,611 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][188], [37#L799true, 99#L766true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, 46#L3true, P2Thread1of1ForFork0InUse, 148#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:53:02,611 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,611 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,611 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,611 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,611 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~b$r_buff1_thd1~0_16 256) 0))) (.cse3 (not (= 0 (mod v_~b$w_buff0_used~0_87 256)))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= 0 (mod v_~b$w_buff1_used~0_81 256))) .cse2)) (.cse4 (and (not (= (mod v_~b$w_buff0_used~0_88 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_81) v_~b$w_buff1_used~0_80) (= (ite .cse1 0 v_~b$r_buff0_thd1~0_25) v_~b$r_buff0_thd1~0_24) (= (ite (or (and .cse2 (not (= (mod v_~b$w_buff1_used~0_80 256) 0))) (and .cse3 (not (= (mod v_~b$r_buff0_thd1~0_24 256) 0)))) 0 v_~b$r_buff1_thd1~0_16) v_~b$r_buff1_thd1~0_15) (= v_~b~0_32 (ite .cse4 v_~b$w_buff0~0_35 (ite .cse0 v_~b$w_buff1~0_30 v_~b~0_33))) (= v_~b$w_buff0_used~0_87 (ite .cse4 0 v_~b$w_buff0_used~0_88))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_88, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_25, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_16, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_81, ~b~0=v_~b~0_33, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_87, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_24, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_80, ~b~0=v_~b~0_32, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0][185], [26#L773true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L792true, 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, 46#L3true, P2Thread1of1ForFork0InUse, 148#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:53:02,611 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,611 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,612 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,612 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,612 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][168], [8#L831true, 99#L766true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L792true, 128#true, 131#true, 148#true, 46#L3true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:53:02,612 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,612 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,612 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,612 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-12 11:53:02,663 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([354] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~b$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~b$r_buff1_thd2~0_16 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd2~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~b$w_buff0_used~0_100 256) 0)) .cse5)) (.cse1 (and .cse2 (not (= (mod v_~b$w_buff1_used~0_91 256) 0)))) (.cse4 (and .cse3 .cse5))) (and (= v_~b~0_40 (ite .cse0 v_~b$w_buff0~0_43 (ite .cse1 v_~b$w_buff1~0_36 v_~b~0_41))) (= (ite .cse0 0 v_~b$w_buff0_used~0_100) v_~b$w_buff0_used~0_99) (= v_~b$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_90 256) 0)) .cse2) (and .cse3 (not (= (mod v_~b$r_buff0_thd2~0_23 256) 0)))) 0 v_~b$r_buff1_thd2~0_16)) (= (ite (or .cse1 .cse4) 0 v_~b$w_buff1_used~0_91) v_~b$w_buff1_used~0_90) (= (ite .cse4 0 v_~b$r_buff0_thd2~0_24) v_~b$r_buff0_thd2~0_23)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_24, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_91, ~b~0=v_~b~0_41, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_16} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_99, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_23, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_90, ~b~0=v_~b~0_40, ~b$w_buff1~0=v_~b$w_buff1~0_36, ~b$w_buff0~0=v_~b$w_buff0~0_43, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_15} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd2~0][188], [114#L3-1true, 99#L766true, 37#L799true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, 148#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:53:02,663 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,663 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,663 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,663 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,663 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([345] L766-->L773: Formula: (let ((.cse2 (not (= (mod v_~b$r_buff1_thd1~0_16 256) 0))) (.cse3 (not (= 0 (mod v_~b$w_buff0_used~0_87 256)))) (.cse5 (not (= (mod v_~b$r_buff0_thd1~0_25 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= 0 (mod v_~b$w_buff1_used~0_81 256))) .cse2)) (.cse4 (and (not (= (mod v_~b$w_buff0_used~0_88 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_81) v_~b$w_buff1_used~0_80) (= (ite .cse1 0 v_~b$r_buff0_thd1~0_25) v_~b$r_buff0_thd1~0_24) (= (ite (or (and .cse2 (not (= (mod v_~b$w_buff1_used~0_80 256) 0))) (and .cse3 (not (= (mod v_~b$r_buff0_thd1~0_24 256) 0)))) 0 v_~b$r_buff1_thd1~0_16) v_~b$r_buff1_thd1~0_15) (= v_~b~0_32 (ite .cse4 v_~b$w_buff0~0_35 (ite .cse0 v_~b$w_buff1~0_30 v_~b~0_33))) (= v_~b$w_buff0_used~0_87 (ite .cse4 0 v_~b$w_buff0_used~0_88))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_88, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_25, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_16, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_81, ~b~0=v_~b~0_33, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_87, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_24, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_80, ~b~0=v_~b~0_32, ~b$w_buff1~0=v_~b$w_buff1~0_30, ~b$w_buff0~0=v_~b$w_buff0~0_35} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$w_buff1_used~0, ~b~0][185], [114#L3-1true, 26#L773true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L792true, 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, P2Thread1of1ForFork0InUse, 148#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, 55#L815true]) [2022-12-12 11:53:02,664 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([362] L815-->L831: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd3~0_60 256) 0))) (let ((.cse10 (not .cse9)) (.cse3 (and (= 0 (mod v_~b$w_buff1_used~0_119 256)) .cse9)) (.cse5 (and .cse8 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_128 256) 0))) (let ((.cse1 (or .cse3 .cse5 .cse11)) (.cse2 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse6 (= (mod v_~b$w_buff1_used~0_118 256) 0)) (.cse4 (= 0 (mod v_~b$w_buff0_used~0_127 256)))) (and (= v_~b$w_buff0~0_60 v_~b$w_buff0~0_59) (= (ite .cse0 v_~b$w_buff0_used~0_128 (ite .cse1 v_~b$w_buff0_used~0_128 (ite .cse2 0 v_~b$w_buff0_used~0_128))) v_~b$w_buff0_used~0_127) (= v_~b$w_buff1~0_53 v_~b$w_buff1~0_52) (= v_~__unbuffered_p2_EBX~0_12 (ite .cse1 v_~b~0_70 (ite .cse2 v_~b$w_buff0~0_60 v_~b$w_buff1~0_53))) (= v_~b$mem_tmp~0_16 v_~b~0_70) (= (ite .cse0 v_~b$w_buff1_used~0_119 (ite (or .cse3 .cse4 .cse5) v_~b$w_buff1_used~0_119 0)) v_~b$w_buff1_used~0_118) (= v_~b~0_68 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p2_EBX~0_12)) (= (ite .cse0 v_~b$r_buff1_thd3~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd3~0_59 256) 0))) (or .cse4 (and .cse6 .cse7) (and .cse8 .cse7))) v_~b$r_buff1_thd3~0_56 0)) v_~b$r_buff1_thd3~0_55) (= v_~b$r_buff0_thd3~0_59 (ite .cse0 v_~b$r_buff0_thd3~0_60 (ite (or .cse4 .cse5 (and .cse6 .cse9)) v_~b$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse10) 0 v_~b$r_buff0_thd3~0_60)))) (= v_~b$flush_delayed~0_21 0) (= |v_P2Thread1of1ForFork0_#t~nondet3_1| v_~weak$$choice0~0_9) (= |v_P2Thread1of1ForFork0_#t~nondet4_1| v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_128, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_60, ~b~0=v_~b~0_70, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_119, P2Thread1of1ForFork0_#t~nondet4=|v_P2Thread1of1ForFork0_#t~nondet4_1|, ~b$w_buff1~0=v_~b$w_buff1~0_53, P2Thread1of1ForFork0_#t~nondet3=|v_P2Thread1of1ForFork0_#t~nondet3_1|, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_56} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_21, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_127, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_118, ~b$w_buff1~0=v_~b$w_buff1~0_52, ~b$w_buff0~0=v_~b$w_buff0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_55} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$r_buff0_thd3~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet4, P2Thread1of1ForFork0_#t~nondet3, ~b$w_buff0_used~0, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0][168], [8#L831true, 114#L3-1true, 99#L766true, 195#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 63#L792true, 221#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 128#true, 131#true, P2Thread1of1ForFork0InUse, 148#true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse]) [2022-12-12 11:53:02,664 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,664 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-12 11:53:02,870 INFO L130 PetriNetUnfolder]: 1823/3575 cut-off events. [2022-12-12 11:53:02,870 INFO L131 PetriNetUnfolder]: For 8361/11509 co-relation queries the response was YES. [2022-12-12 11:53:02,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15168 conditions, 3575 events. 1823/3575 cut-off events. For 8361/11509 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 26236 event pairs, 63 based on Foata normal form. 538/3955 useless extension candidates. Maximal degree in co-relation 15106. Up to 1329 conditions per place. [2022-12-12 11:53:02,898 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 181 selfloop transitions, 46 changer transitions 126/439 dead transitions. [2022-12-12 11:53:02,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 439 transitions, 4178 flow [2022-12-12 11:53:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 11:53:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 11:53:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1596 transitions. [2022-12-12 11:53:02,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8525641025641025 [2022-12-12 11:53:02,906 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 32 predicate places. [2022-12-12 11:53:02,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 439 transitions, 4178 flow [2022-12-12 11:53:02,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 439 transitions, 3714 flow, removed 205 selfloop flow, removed 7 redundant places. [2022-12-12 11:53:02,923 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 439 transitions, 3714 flow [2022-12-12 11:53:02,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 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-12 11:53:02,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:02,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:02,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:53:02,925 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-12 11:53:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:02,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1301876382, now seen corresponding path program 1 times [2022-12-12 11:53:02,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:02,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892522540] [2022-12-12 11:53:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:02,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:53:03,731 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-12 11:53:03,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:53:03,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892522540] [2022-12-12 11:53:03,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892522540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:53:03,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:53:03,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 11:53:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032042214] [2022-12-12 11:53:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:53:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:53:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:53:03,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:53:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:53:03,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 117 [2022-12-12 11:53:03,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 439 transitions, 3714 flow. Second operand has 10 states, 10 states have (on average 92.2) internal successors, (922), 10 states have internal predecessors, (922), 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-12 11:53:03,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:53:03,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 117 [2022-12-12 11:53:03,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:53:04,819 INFO L130 PetriNetUnfolder]: 2938/6288 cut-off events. [2022-12-12 11:53:04,819 INFO L131 PetriNetUnfolder]: For 19007/20487 co-relation queries the response was YES. [2022-12-12 11:53:04,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23780 conditions, 6288 events. 2938/6288 cut-off events. For 19007/20487 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54567 event pairs, 89 based on Foata normal form. 14/6132 useless extension candidates. Maximal degree in co-relation 23711. Up to 1898 conditions per place. [2022-12-12 11:53:04,868 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 88 selfloop transitions, 86 changer transitions 324/634 dead transitions. [2022-12-12 11:53:04,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 634 transitions, 6850 flow [2022-12-12 11:53:04,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 11:53:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 11:53:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 945 transitions. [2022-12-12 11:53:04,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2022-12-12 11:53:04,872 INFO L295 CegarLoopForPetriNet]: 122 programPoint places, 34 predicate places. [2022-12-12 11:53:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 634 transitions, 6850 flow [2022-12-12 11:53:04,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 634 transitions, 6335 flow, removed 257 selfloop flow, removed 1 redundant places. [2022-12-12 11:53:04,891 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 634 transitions, 6335 flow [2022-12-12 11:53:04,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.2) internal successors, (922), 10 states have internal predecessors, (922), 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-12 11:53:04,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:53:04,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:04,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 11:53:04,893 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-12 11:53:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:53:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1471011550, now seen corresponding path program 2 times [2022-12-12 11:53:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:53:04,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774531547] [2022-12-12 11:53:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:53:04,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:53:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:04,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 11:53:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 11:53:05,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 11:53:05,029 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 11:53:05,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 11:53:05,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 11:53:05,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 11:53:05,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 11:53:05,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 11:53:05,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 11:53:05,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 11:53:05,033 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-12 11:53:05,038 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:53:05,038 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:53:05,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:53:05 BasicIcfg [2022-12-12 11:53:05,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:53:05,175 INFO L158 Benchmark]: Toolchain (without parser) took 11371.68ms. Allocated memory was 217.1MB in the beginning and 843.1MB in the end (delta: 626.0MB). Free memory was 179.5MB in the beginning and 354.7MB in the end (delta: -175.2MB). Peak memory consumption was 450.8MB. Max. memory is 8.0GB. [2022-12-12 11:53:05,175 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 217.1MB. Free memory is still 193.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:53:05,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.05ms. Allocated memory is still 217.1MB. Free memory was 179.0MB in the beginning and 151.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-12 11:53:05,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 217.1MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:53:05,176 INFO L158 Benchmark]: Boogie Preprocessor took 53.03ms. Allocated memory is still 217.1MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:53:05,178 INFO L158 Benchmark]: RCFGBuilder took 666.56ms. Allocated memory is still 217.1MB. Free memory was 147.5MB in the beginning and 112.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-12 11:53:05,178 INFO L158 Benchmark]: TraceAbstraction took 10008.54ms. Allocated memory was 217.1MB in the beginning and 843.1MB in the end (delta: 626.0MB). Free memory was 111.3MB in the beginning and 354.7MB in the end (delta: -243.4MB). Peak memory consumption was 383.7MB. Max. memory is 8.0GB. [2022-12-12 11:53:05,180 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.14ms. Allocated memory is still 217.1MB. Free memory is still 193.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 582.05ms. Allocated memory is still 217.1MB. Free memory was 179.0MB in the beginning and 151.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 217.1MB. Free memory was 151.7MB in the beginning and 149.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.03ms. Allocated memory is still 217.1MB. Free memory was 149.6MB in the beginning and 147.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 666.56ms. Allocated memory is still 217.1MB. Free memory was 147.5MB in the beginning and 112.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10008.54ms. Allocated memory was 217.1MB in the beginning and 843.1MB in the end (delta: 626.0MB). Free memory was 111.3MB in the beginning and 354.7MB in the end (delta: -243.4MB). Peak memory consumption was 383.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L723] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0] [L724] 0 _Bool b$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0] [L725] 0 int b$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0] [L726] 0 _Bool b$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0] [L727] 0 _Bool b$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0] [L728] 0 _Bool b$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0] [L729] 0 _Bool b$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0] [L730] 0 _Bool b$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0] [L731] 0 _Bool b$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0] [L732] 0 _Bool b$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0] [L733] 0 _Bool b$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0] [L734] 0 _Bool b$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0] [L735] 0 int *b$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}] [L736] 0 int b$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0] [L737] 0 _Bool b$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0] [L738] 0 int b$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0] [L739] 0 _Bool b$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0] [L740] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0] [L741] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L743] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t849; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t849, ((void *)0), P0, ((void *)0))=-2, t849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t849={5:0}, t850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t850, ((void *)0), P1, ((void *)0))=-1, t849={5:0}, t850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L859] 0 pthread_t t851; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t851, ((void *)0), P2, ((void *)0))=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 910 IncrementalHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 71 mSDtfsCounter, 910 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6335occurred in iteration=7, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1320 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 3184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-12 11:53:05,202 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...