/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_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:36:51,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:36:51,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:36:51,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:36:51,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:36:51,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:36:51,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:36:51,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:36:51,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:36:51,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:36:51,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:36:51,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:36:51,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:36:51,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:36:51,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:36:51,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:36:51,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:36:51,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:36:51,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:36:51,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:36:51,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:36:51,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:36:51,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:36:51,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:36:51,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:36:51,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:36:51,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:36:51,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:36:51,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:36:51,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:36:51,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:36:51,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:36:51,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:36:51,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:36:51,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:36:51,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:36:51,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:36:51,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:36:51,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:36:51,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:36:51,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:36:51,228 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-11 23:36:51,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:36:51,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:36:51,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:36:51,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:36:51,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:36:51,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:36:51,244 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:36:51,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:36:51,244 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:36:51,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:36:51,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:36:51,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:36:51,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:36:51,247 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:36:51,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:36:51,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:36:51,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:36:51,247 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_DEAD [2022-12-11 23:36:51,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:36:51,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:36:51,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:36:51,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:36:51,480 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:36:51,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2022-12-11 23:36:52,335 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:36:52,600 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:36:52,601 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2022-12-11 23:36:52,615 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a7c66f2/d47e3937b94e4ffabaf46b007c82b8af/FLAGcc923e4f9 [2022-12-11 23:36:52,631 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a7c66f2/d47e3937b94e4ffabaf46b007c82b8af [2022-12-11 23:36:52,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:36:52,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:36:52,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:36:52,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:36:52,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:36:52,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:36:52" (1/1) ... [2022-12-11 23:36:52,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8a7f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:52, skipping insertion in model container [2022-12-11 23:36:52,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:36:52" (1/1) ... [2022-12-11 23:36:52,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:36:52,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:36:52,822 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/mix031.oepc.i[945,958] [2022-12-11 23:36:52,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:52,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:52,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:36:52,993 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:36:53,003 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/mix031.oepc.i[945,958] [2022-12-11 23:36:53,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 23:36:53,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 23:36:53,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:36:53,086 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:36:53,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53 WrapperNode [2022-12-11 23:36:53,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:36:53,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:36:53,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:36:53,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:36:53,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,144 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2022-12-11 23:36:53,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:36:53,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:36:53,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:36:53,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:36:53,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,184 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:36:53,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:36:53,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:36:53,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:36:53,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (1/1) ... [2022-12-11 23:36:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:36:53,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:36:53,227 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-11 23:36:53,245 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-11 23:36:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:36:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 23:36:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:36:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:36:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:36:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 23:36:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 23:36:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 23:36:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 23:36:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:36:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 23:36:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:36:53,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:36:53,276 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:36:53,370 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:36:53,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:36:53,643 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:36:53,761 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:36:53,761 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 23:36:53,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:36:53 BoogieIcfgContainer [2022-12-11 23:36:53,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:36:53,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:36:53,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:36:53,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:36:53,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:36:52" (1/3) ... [2022-12-11 23:36:53,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f2de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:36:53, skipping insertion in model container [2022-12-11 23:36:53,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:36:53" (2/3) ... [2022-12-11 23:36:53,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171f2de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:36:53, skipping insertion in model container [2022-12-11 23:36:53,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:36:53" (3/3) ... [2022-12-11 23:36:53,772 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2022-12-11 23:36:53,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:36:53,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 23:36:53,786 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:36:53,846 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 23:36:53,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-12-11 23:36:53,921 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-12-11 23:36:53,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:36:53,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-11 23:36:53,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-12-11 23:36:53,929 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-12-11 23:36:53,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:36:53,944 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;@6efad2e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:36:53,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 23:36:53,961 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-11 23:36:53,962 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:36:53,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:53,963 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] [2022-12-11 23:36:53,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash 363094417, now seen corresponding path program 1 times [2022-12-11 23:36:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:53,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929560316] [2022-12-11 23:36:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:54,386 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-11 23:36:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929560316] [2022-12-11 23:36:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929560316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:54,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:54,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:36:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34113139] [2022-12-11 23:36:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:54,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:36:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:36:54,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:36:54,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2022-12-11 23:36:54,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-11 23:36:54,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:54,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2022-12-11 23:36:54,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:54,508 INFO L130 PetriNetUnfolder]: 18/161 cut-off events. [2022-12-11 23:36:54,508 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-11 23:36:54,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 161 events. 18/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 461 event pairs, 2 based on Foata normal form. 13/167 useless extension candidates. Maximal degree in co-relation 164. Up to 31 conditions per place. [2022-12-11 23:36:54,511 INFO L137 encePairwiseOnDemand]: 91/96 looper letters, 10 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-12-11 23:36:54,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 221 flow [2022-12-11 23:36:54,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:36:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:36:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2022-12-11 23:36:54,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9340277777777778 [2022-12-11 23:36:54,528 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2022-12-11 23:36:54,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 221 flow [2022-12-11 23:36:54,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 221 flow [2022-12-11 23:36:54,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 221 flow [2022-12-11 23:36:54,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-11 23:36:54,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:54,532 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] [2022-12-11 23:36:54,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:36:54,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1791141370, now seen corresponding path program 1 times [2022-12-11 23:36:54,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:54,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530879352] [2022-12-11 23:36:54,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:54,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:54,918 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-11 23:36:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:54,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530879352] [2022-12-11 23:36:54,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530879352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:54,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:54,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:36:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117387176] [2022-12-11 23:36:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:54,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:36:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:36:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:36:54,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2022-12-11 23:36:54,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 7 states have internal predecessors, (510), 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-11 23:36:54,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:54,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2022-12-11 23:36:54,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:55,266 INFO L130 PetriNetUnfolder]: 319/970 cut-off events. [2022-12-11 23:36:55,267 INFO L131 PetriNetUnfolder]: For 180/270 co-relation queries the response was YES. [2022-12-11 23:36:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 970 events. 319/970 cut-off events. For 180/270 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6177 event pairs, 76 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1741. Up to 293 conditions per place. [2022-12-11 23:36:55,274 INFO L137 encePairwiseOnDemand]: 88/96 looper letters, 26 selfloop transitions, 4 changer transitions 56/148 dead transitions. [2022-12-11 23:36:55,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 148 transitions, 543 flow [2022-12-11 23:36:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:36:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:36:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 780 transitions. [2022-12-11 23:36:55,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8125 [2022-12-11 23:36:55,278 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 9 predicate places. [2022-12-11 23:36:55,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 148 transitions, 543 flow [2022-12-11 23:36:55,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 92 transitions, 285 flow [2022-12-11 23:36:55,283 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 285 flow [2022-12-11 23:36:55,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.85714285714286) internal successors, (510), 7 states have internal predecessors, (510), 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-11 23:36:55,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:55,283 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] [2022-12-11 23:36:55,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:36:55,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash -83949948, now seen corresponding path program 1 times [2022-12-11 23:36:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:55,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786495747] [2022-12-11 23:36:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:55,463 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-11 23:36:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:55,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786495747] [2022-12-11 23:36:55,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786495747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:55,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:55,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:36:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951845471] [2022-12-11 23:36:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:55,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:36:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:36:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:36:55,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 96 [2022-12-11 23:36:55,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-11 23:36:55,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:55,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 96 [2022-12-11 23:36:55,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:55,676 INFO L130 PetriNetUnfolder]: 186/504 cut-off events. [2022-12-11 23:36:55,676 INFO L131 PetriNetUnfolder]: For 245/465 co-relation queries the response was YES. [2022-12-11 23:36:55,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 504 events. 186/504 cut-off events. For 245/465 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2197 event pairs, 44 based on Foata normal form. 16/500 useless extension candidates. Maximal degree in co-relation 1269. Up to 315 conditions per place. [2022-12-11 23:36:55,678 INFO L137 encePairwiseOnDemand]: 90/96 looper letters, 26 selfloop transitions, 3 changer transitions 34/131 dead transitions. [2022-12-11 23:36:55,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 131 transitions, 628 flow [2022-12-11 23:36:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 23:36:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 23:36:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 733 transitions. [2022-12-11 23:36:55,680 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8483796296296297 [2022-12-11 23:36:55,681 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2022-12-11 23:36:55,681 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 131 transitions, 628 flow [2022-12-11 23:36:55,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 97 transitions, 376 flow [2022-12-11 23:36:55,684 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 376 flow [2022-12-11 23:36:55,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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-11 23:36:55,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:55,685 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] [2022-12-11 23:36:55,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:36:55,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1355460249, now seen corresponding path program 1 times [2022-12-11 23:36:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:55,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958314409] [2022-12-11 23:36:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:55,864 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-11 23:36:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:55,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958314409] [2022-12-11 23:36:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958314409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:55,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:55,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 23:36:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45392281] [2022-12-11 23:36:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:55,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 23:36:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 23:36:55,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 23:36:55,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-12-11 23:36:55,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 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-11 23:36:55,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:55,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-12-11 23:36:55,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:56,069 INFO L130 PetriNetUnfolder]: 269/700 cut-off events. [2022-12-11 23:36:56,069 INFO L131 PetriNetUnfolder]: For 1161/1208 co-relation queries the response was YES. [2022-12-11 23:36:56,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 700 events. 269/700 cut-off events. For 1161/1208 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3865 event pairs, 14 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 1910. Up to 261 conditions per place. [2022-12-11 23:36:56,072 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 57 selfloop transitions, 12 changer transitions 23/159 dead transitions. [2022-12-11 23:36:56,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 921 flow [2022-12-11 23:36:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:36:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:36:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 821 transitions. [2022-12-11 23:36:56,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8552083333333333 [2022-12-11 23:36:56,075 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 6 predicate places. [2022-12-11 23:36:56,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 159 transitions, 921 flow [2022-12-11 23:36:56,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 136 transitions, 739 flow [2022-12-11 23:36:56,078 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 136 transitions, 739 flow [2022-12-11 23:36:56,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 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-11 23:36:56,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:56,078 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-11 23:36:56,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:36:56,078 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1450280008, now seen corresponding path program 1 times [2022-12-11 23:36:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:56,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123722427] [2022-12-11 23:36:56,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:56,208 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-11 23:36:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:56,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123722427] [2022-12-11 23:36:56,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123722427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:56,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:56,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 23:36:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673251108] [2022-12-11 23:36:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:56,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 23:36:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 23:36:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 23:36:56,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-12-11 23:36:56,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 136 transitions, 739 flow. Second operand has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 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-11 23:36:56,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:56,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-12-11 23:36:56,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:56,421 INFO L130 PetriNetUnfolder]: 163/532 cut-off events. [2022-12-11 23:36:56,421 INFO L131 PetriNetUnfolder]: For 873/1046 co-relation queries the response was YES. [2022-12-11 23:36:56,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 532 events. 163/532 cut-off events. For 873/1046 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3054 event pairs, 17 based on Foata normal form. 56/566 useless extension candidates. Maximal degree in co-relation 1672. Up to 154 conditions per place. [2022-12-11 23:36:56,423 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 52 selfloop transitions, 15 changer transitions 24/158 dead transitions. [2022-12-11 23:36:56,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 158 transitions, 1039 flow [2022-12-11 23:36:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:36:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:36:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1035 transitions. [2022-12-11 23:36:56,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8293269230769231 [2022-12-11 23:36:56,426 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 18 predicate places. [2022-12-11 23:36:56,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 158 transitions, 1039 flow [2022-12-11 23:36:56,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 134 transitions, 841 flow [2022-12-11 23:36:56,428 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 134 transitions, 841 flow [2022-12-11 23:36:56,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.85714285714286) internal successors, (538), 7 states have internal predecessors, (538), 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-11 23:36:56,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:56,429 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] [2022-12-11 23:36:56,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:36:56,429 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash 367817406, now seen corresponding path program 1 times [2022-12-11 23:36:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:56,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275669219] [2022-12-11 23:36:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:56,607 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-11 23:36:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:56,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275669219] [2022-12-11 23:36:56,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275669219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:56,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:56,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 23:36:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854070924] [2022-12-11 23:36:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:56,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 23:36:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 23:36:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 23:36:56,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2022-12-11 23:36:56,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 134 transitions, 841 flow. Second operand has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 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-11 23:36:56,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:56,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2022-12-11 23:36:56,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:56,765 INFO L130 PetriNetUnfolder]: 198/702 cut-off events. [2022-12-11 23:36:56,765 INFO L131 PetriNetUnfolder]: For 1607/1873 co-relation queries the response was YES. [2022-12-11 23:36:56,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 702 events. 198/702 cut-off events. For 1607/1873 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4810 event pairs, 24 based on Foata normal form. 30/711 useless extension candidates. Maximal degree in co-relation 2468. Up to 197 conditions per place. [2022-12-11 23:36:56,769 INFO L137 encePairwiseOnDemand]: 86/96 looper letters, 25 selfloop transitions, 5 changer transitions 64/155 dead transitions. [2022-12-11 23:36:56,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 155 transitions, 1203 flow [2022-12-11 23:36:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 23:36:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 23:36:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 588 transitions. [2022-12-11 23:36:56,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.765625 [2022-12-11 23:36:56,771 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 22 predicate places. [2022-12-11 23:36:56,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 155 transitions, 1203 flow [2022-12-11 23:36:56,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 91 transitions, 495 flow [2022-12-11 23:36:56,773 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 495 flow [2022-12-11 23:36:56,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.75) internal successors, (574), 8 states have internal predecessors, (574), 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-11 23:36:56,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:56,773 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] [2022-12-11 23:36:56,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:36:56,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1138492602, now seen corresponding path program 2 times [2022-12-11 23:36:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:56,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839024302] [2022-12-11 23:36:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:36:57,179 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-11 23:36:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:36:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839024302] [2022-12-11 23:36:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839024302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:36:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:36:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 23:36:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950336125] [2022-12-11 23:36:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:36:57,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 23:36:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:36:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 23:36:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-11 23:36:57,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2022-12-11 23:36:57,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 495 flow. Second operand has 9 states, 9 states have (on average 73.22222222222223) internal successors, (659), 9 states have internal predecessors, (659), 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-11 23:36:57,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:36:57,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2022-12-11 23:36:57,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:36:57,313 INFO L130 PetriNetUnfolder]: 14/158 cut-off events. [2022-12-11 23:36:57,314 INFO L131 PetriNetUnfolder]: For 452/522 co-relation queries the response was YES. [2022-12-11 23:36:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 158 events. 14/158 cut-off events. For 452/522 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 344 event pairs, 1 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 427. Up to 36 conditions per place. [2022-12-11 23:36:57,314 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 20 selfloop transitions, 5 changer transitions 13/101 dead transitions. [2022-12-11 23:36:57,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 101 transitions, 690 flow [2022-12-11 23:36:57,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 23:36:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 23:36:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 741 transitions. [2022-12-11 23:36:57,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.771875 [2022-12-11 23:36:57,316 INFO L295 CegarLoopForPetriNet]: 99 programPoint places, 17 predicate places. [2022-12-11 23:36:57,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 101 transitions, 690 flow [2022-12-11 23:36:57,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 88 transitions, 500 flow [2022-12-11 23:36:57,317 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 88 transitions, 500 flow [2022-12-11 23:36:57,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 73.22222222222223) internal successors, (659), 9 states have internal predecessors, (659), 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-11 23:36:57,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:36:57,318 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] [2022-12-11 23:36:57,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:36:57,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-11 23:36:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:36:57,319 INFO L85 PathProgramCache]: Analyzing trace with hash 214556546, now seen corresponding path program 3 times [2022-12-11 23:36:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:36:57,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365545347] [2022-12-11 23:36:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:36:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:36:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:36:57,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 23:36:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 23:36:57,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 23:36:57,402 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 23:36:57,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 23:36:57,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-11 23:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 23:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 23:36:57,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-11 23:36:57,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:36:57,404 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-11 23:36:57,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 23:36:57,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 23:36:57,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 11:36:57 BasicIcfg [2022-12-11 23:36:57,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 23:36:57,477 INFO L158 Benchmark]: Toolchain (without parser) took 4843.30ms. Allocated memory was 207.6MB in the beginning and 394.3MB in the end (delta: 186.6MB). Free memory was 181.3MB in the beginning and 348.4MB in the end (delta: -167.1MB). Peak memory consumption was 207.7MB. Max. memory is 8.0GB. [2022-12-11 23:36:57,477 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 207.6MB. Free memory is still 183.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:36:57,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.01ms. Allocated memory is still 207.6MB. Free memory was 180.8MB in the beginning and 155.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 23:36:57,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.48ms. Allocated memory is still 207.6MB. Free memory was 155.1MB in the beginning and 153.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:36:57,478 INFO L158 Benchmark]: Boogie Preprocessor took 41.02ms. Allocated memory is still 207.6MB. Free memory was 153.0MB in the beginning and 150.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:36:57,478 INFO L158 Benchmark]: RCFGBuilder took 577.65ms. Allocated memory is still 207.6MB. Free memory was 150.9MB in the beginning and 120.0MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-11 23:36:57,478 INFO L158 Benchmark]: TraceAbstraction took 3709.57ms. Allocated memory was 207.6MB in the beginning and 394.3MB in the end (delta: 186.6MB). Free memory was 118.9MB in the beginning and 348.4MB in the end (delta: -229.5MB). Peak memory consumption was 144.8MB. Max. memory is 8.0GB. [2022-12-11 23:36:57,480 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 207.6MB. Free memory is still 183.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.01ms. Allocated memory is still 207.6MB. Free memory was 180.8MB in the beginning and 155.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.48ms. Allocated memory is still 207.6MB. Free memory was 155.1MB in the beginning and 153.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.02ms. Allocated memory is still 207.6MB. Free memory was 153.0MB in the beginning and 150.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 577.65ms. Allocated memory is still 207.6MB. Free memory was 150.9MB in the beginning and 120.0MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3709.57ms. Allocated memory was 207.6MB in the beginning and 394.3MB in the end (delta: 186.6MB). Free memory was 118.9MB in the beginning and 348.4MB in the end (delta: -229.5MB). Peak memory consumption was 144.8MB. 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L719] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L720] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L721] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L722] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L723] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L724] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L725] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L726] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L727] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L728] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L729] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L730] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L731] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L732] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L733] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L734] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L736] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L827] 0 pthread_t t833; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t833, ((void *)0), P0, ((void *)0))=-1, t833={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L760] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L829] 0 pthread_t t834; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t834, ((void *)0), P1, ((void *)0))=0, t833={5:0}, t834={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L763] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L783] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L786] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 a$flush_delayed = weak$$choice2 [L792] 2 a$mem_tmp = a [L793] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L794] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L795] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L796] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L797] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L798] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L799] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L800] 2 __unbuffered_p1_EBX = a [L801] 2 a = a$flush_delayed ? a$mem_tmp : a [L802] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L805] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L806] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L807] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L808] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L809] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L837] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L838] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L839] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L840] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L843] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t833={5:0}, t834={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L845] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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: 828]: 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: 830]: 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 5 procedures, 118 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 64 mSDtfsCounter, 594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=841occurred in iteration=5, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 1788 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 2257 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-11 23:36:57,495 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...