/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:50:46,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:50:46,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:50:46,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:50:46,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:50:46,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:50:46,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:50:46,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:50:46,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:50:46,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:50:46,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:50:46,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:50:46,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:50:46,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:50:46,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:50:46,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:50:46,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:50:46,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:50:46,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:50:46,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:50:46,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:50:46,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:50:46,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:50:46,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:50:46,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:50:46,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:50:46,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:50:46,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:50:46,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:50:46,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:50:46,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:50:46,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:50:46,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:50:46,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:50:46,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:50:46,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:50:46,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:50:46,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:50:46,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:50:46,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:50:46,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:50:46,997 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 20:50:47,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:50:47,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:50:47,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:50:47,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:50:47,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:50:47,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:50:47,031 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:50:47,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:50:47,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:50:47,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:50:47,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:50:47,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:50:47,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:50:47,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:50:47,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:50:47,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:50:47,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:50:47,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:50:47,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:50:47,034 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:50:47,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:50:47,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:50:47,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:50:47,034 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 [2022-12-11 20:50:47,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:50:47,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:50:47,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:50:47,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:50:47,301 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:50:47,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2022-12-11 20:50:48,273 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:50:48,571 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:50:48,572 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2022-12-11 20:50:48,592 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19537f8fa/0dafcf8c60d945b08b06f79e3f36e388/FLAG31ec402ff [2022-12-11 20:50:48,616 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19537f8fa/0dafcf8c60d945b08b06f79e3f36e388 [2022-12-11 20:50:48,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:50:48,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:50:48,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:50:48,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:50:48,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:50:48,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:50:48" (1/1) ... [2022-12-11 20:50:48,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284df926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:48, skipping insertion in model container [2022-12-11 20:50:48,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:50:48" (1/1) ... [2022-12-11 20:50:48,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:50:48,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:50:48,816 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/mix000.oepc.i[988,1001] [2022-12-11 20:50:48,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:48,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:48,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:50:49,013 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:50:49,021 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/mix000.oepc.i[988,1001] [2022-12-11 20:50:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:50:49,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:50:49,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:50:49,086 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:50:49,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49 WrapperNode [2022-12-11 20:50:49,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:50:49,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:50:49,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:50:49,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:50:49,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,153 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-11 20:50:49,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:50:49,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:50:49,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:50:49,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:50:49,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:50:49,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:50:49,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:50:49,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:50:49,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (1/1) ... [2022-12-11 20:50:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:50:49,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:50:49,237 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 20:50:49,262 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 20:50:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:50:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:50:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:50:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:50:49,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:50:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 20:50:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 20:50:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 20:50:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 20:50:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:50:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:50:49,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:50:49,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:50:49,310 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 20:50:49,453 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:50:49,455 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:50:49,753 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:50:49,889 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:50:49,889 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 20:50:49,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:50:49 BoogieIcfgContainer [2022-12-11 20:50:49,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:50:49,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:50:49,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:50:49,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:50:49,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:50:48" (1/3) ... [2022-12-11 20:50:49,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a5cf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:50:49, skipping insertion in model container [2022-12-11 20:50:49,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:50:49" (2/3) ... [2022-12-11 20:50:49,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a5cf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:50:49, skipping insertion in model container [2022-12-11 20:50:49,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:50:49" (3/3) ... [2022-12-11 20:50:49,900 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2022-12-11 20:50:49,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:50:49,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:50:49,913 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:50:49,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 20:50:50,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 194 flow [2022-12-11 20:50:50,065 INFO L130 PetriNetUnfolder]: 2/90 cut-off events. [2022-12-11 20:50:50,066 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:50:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-11 20:50:50,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 92 transitions, 194 flow [2022-12-11 20:50:50,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 186 flow [2022-12-11 20:50:50,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:50:50,092 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;@6f1e2701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:50:50,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-11 20:50:50,108 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-11 20:50:50,108 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:50:50,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:50,109 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] [2022-12-11 20:50:50,110 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 20:50:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1579952717, now seen corresponding path program 1 times [2022-12-11 20:50:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:50,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767232166] [2022-12-11 20:50:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:50,532 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 20:50:50,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767232166] [2022-12-11 20:50:50,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767232166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:50,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:50:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015710719] [2022-12-11 20:50:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:50,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:50:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:50:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:50:50,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2022-12-11 20:50:50,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 20:50:50,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:50,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2022-12-11 20:50:50,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:50,669 INFO L130 PetriNetUnfolder]: 26/159 cut-off events. [2022-12-11 20:50:50,669 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-11 20:50:50,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 159 events. 26/159 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 464 event pairs, 2 based on Foata normal form. 13/159 useless extension candidates. Maximal degree in co-relation 181. Up to 46 conditions per place. [2022-12-11 20:50:50,671 INFO L137 encePairwiseOnDemand]: 87/92 looper letters, 11 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2022-12-11 20:50:50,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 215 flow [2022-12-11 20:50:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:50:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:50:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-12-11 20:50:50,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9239130434782609 [2022-12-11 20:50:50,696 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2022-12-11 20:50:50,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 215 flow [2022-12-11 20:50:50,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 90 transitions, 215 flow [2022-12-11 20:50:50,698 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 215 flow [2022-12-11 20:50:50,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 20:50:50,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:50,699 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] [2022-12-11 20:50:50,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:50:50,699 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 20:50:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1282779464, now seen corresponding path program 1 times [2022-12-11 20:50:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:50,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523822718] [2022-12-11 20:50:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:50,943 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 20:50:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:50,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523822718] [2022-12-11 20:50:50,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523822718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:50,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:50,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:50:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537549317] [2022-12-11 20:50:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:50,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:50:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:50:50,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:50:50,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2022-12-11 20:50:50,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 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 20:50:50,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:50,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2022-12-11 20:50:50,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:51,317 INFO L130 PetriNetUnfolder]: 319/924 cut-off events. [2022-12-11 20:50:51,318 INFO L131 PetriNetUnfolder]: For 249/434 co-relation queries the response was YES. [2022-12-11 20:50:51,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 924 events. 319/924 cut-off events. For 249/434 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5691 event pairs, 62 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1744. Up to 293 conditions per place. [2022-12-11 20:50:51,327 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 26 selfloop transitions, 4 changer transitions 56/144 dead transitions. [2022-12-11 20:50:51,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 144 transitions, 551 flow [2022-12-11 20:50:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:50:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:50:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 740 transitions. [2022-12-11 20:50:51,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8043478260869565 [2022-12-11 20:50:51,335 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2022-12-11 20:50:51,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 144 transitions, 551 flow [2022-12-11 20:50:51,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 88 transitions, 281 flow [2022-12-11 20:50:51,341 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 88 transitions, 281 flow [2022-12-11 20:50:51,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 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 20:50:51,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:51,341 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] [2022-12-11 20:50:51,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:50:51,342 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 20:50:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash 733963152, now seen corresponding path program 1 times [2022-12-11 20:50:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:51,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131730670] [2022-12-11 20:50:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:51,582 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 20:50:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:51,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131730670] [2022-12-11 20:50:51,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131730670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:51,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:51,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:50:51,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911649553] [2022-12-11 20:50:51,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:51,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:50:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:51,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:50:51,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:50:51,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2022-12-11 20:50:51,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 88 transitions, 281 flow. Second operand has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 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 20:50:51,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:51,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2022-12-11 20:50:51,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:51,819 INFO L130 PetriNetUnfolder]: 186/476 cut-off events. [2022-12-11 20:50:51,819 INFO L131 PetriNetUnfolder]: For 215/986 co-relation queries the response was YES. [2022-12-11 20:50:51,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 476 events. 186/476 cut-off events. For 215/986 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2023 event pairs, 30 based on Foata normal form. 18/479 useless extension candidates. Maximal degree in co-relation 1310. Up to 315 conditions per place. [2022-12-11 20:50:51,821 INFO L137 encePairwiseOnDemand]: 86/92 looper letters, 33 selfloop transitions, 3 changer transitions 37/131 dead transitions. [2022-12-11 20:50:51,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 131 transitions, 666 flow [2022-12-11 20:50:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:50:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:50:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 661 transitions. [2022-12-11 20:50:51,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7983091787439613 [2022-12-11 20:50:51,825 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 3 predicate places. [2022-12-11 20:50:51,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 131 transitions, 666 flow [2022-12-11 20:50:51,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 94 transitions, 390 flow [2022-12-11 20:50:51,827 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 94 transitions, 390 flow [2022-12-11 20:50:51,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.0) internal successors, (483), 7 states have internal predecessors, (483), 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 20:50:51,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:51,828 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 20:50:51,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:50:51,828 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 20:50:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1390409567, now seen corresponding path program 1 times [2022-12-11 20:50:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:51,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475907727] [2022-12-11 20:50:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:52,041 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 20:50:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475907727] [2022-12-11 20:50:52,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475907727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:52,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:52,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:50:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528731591] [2022-12-11 20:50:52,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:52,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:50:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:52,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:50:52,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:50:52,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2022-12-11 20:50:52,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 94 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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 20:50:52,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:52,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2022-12-11 20:50:52,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:52,305 INFO L130 PetriNetUnfolder]: 301/724 cut-off events. [2022-12-11 20:50:52,305 INFO L131 PetriNetUnfolder]: For 1186/1337 co-relation queries the response was YES. [2022-12-11 20:50:52,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 724 events. 301/724 cut-off events. For 1186/1337 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3864 event pairs, 16 based on Foata normal form. 3/705 useless extension candidates. Maximal degree in co-relation 2108. Up to 292 conditions per place. [2022-12-11 20:50:52,311 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 42 selfloop transitions, 6 changer transitions 55/165 dead transitions. [2022-12-11 20:50:52,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 165 transitions, 1029 flow [2022-12-11 20:50:52,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:50:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:50:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-12-11 20:50:52,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8467391304347827 [2022-12-11 20:50:52,318 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2022-12-11 20:50:52,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 165 transitions, 1029 flow [2022-12-11 20:50:52,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 110 transitions, 587 flow [2022-12-11 20:50:52,322 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 587 flow [2022-12-11 20:50:52,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.0) internal successors, (432), 6 states have internal predecessors, (432), 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 20:50:52,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:52,323 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] [2022-12-11 20:50:52,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:50:52,323 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 20:50:52,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2028821512, now seen corresponding path program 1 times [2022-12-11 20:50:52,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:52,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774511556] [2022-12-11 20:50:52,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:52,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:52,556 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 20:50:52,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:52,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774511556] [2022-12-11 20:50:52,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774511556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:52,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:52,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:50:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497337143] [2022-12-11 20:50:52,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:52,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:50:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:50:52,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:50:52,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2022-12-11 20:50:52,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 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 20:50:52,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:52,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2022-12-11 20:50:52,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:52,731 INFO L130 PetriNetUnfolder]: 83/300 cut-off events. [2022-12-11 20:50:52,731 INFO L131 PetriNetUnfolder]: For 436/572 co-relation queries the response was YES. [2022-12-11 20:50:52,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 300 events. 83/300 cut-off events. For 436/572 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1251 event pairs, 13 based on Foata normal form. 8/303 useless extension candidates. Maximal degree in co-relation 935. Up to 93 conditions per place. [2022-12-11 20:50:52,733 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 39 selfloop transitions, 9 changer transitions 20/130 dead transitions. [2022-12-11 20:50:52,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 130 transitions, 845 flow [2022-12-11 20:50:52,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 20:50:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 20:50:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 822 transitions. [2022-12-11 20:50:52,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8122529644268774 [2022-12-11 20:50:52,736 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 12 predicate places. [2022-12-11 20:50:52,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 130 transitions, 845 flow [2022-12-11 20:50:52,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 110 transitions, 671 flow [2022-12-11 20:50:52,737 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 110 transitions, 671 flow [2022-12-11 20:50:52,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 72.0) internal successors, (504), 7 states have internal predecessors, (504), 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 20:50:52,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:52,738 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] [2022-12-11 20:50:52,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:50:52,738 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 20:50:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 466295625, now seen corresponding path program 1 times [2022-12-11 20:50:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:52,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292050135] [2022-12-11 20:50:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:53,818 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 20:50:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:53,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292050135] [2022-12-11 20:50:53,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292050135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:53,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:53,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 20:50:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802208678] [2022-12-11 20:50:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:53,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 20:50:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 20:50:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-11 20:50:53,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 92 [2022-12-11 20:50:53,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 110 transitions, 671 flow. Second operand has 12 states, 12 states have (on average 65.91666666666667) internal successors, (791), 12 states have internal predecessors, (791), 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 20:50:53,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:53,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 92 [2022-12-11 20:50:53,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:54,007 INFO L130 PetriNetUnfolder]: 69/336 cut-off events. [2022-12-11 20:50:54,008 INFO L131 PetriNetUnfolder]: For 758/927 co-relation queries the response was YES. [2022-12-11 20:50:54,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 336 events. 69/336 cut-off events. For 758/927 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1677 event pairs, 16 based on Foata normal form. 13/343 useless extension candidates. Maximal degree in co-relation 1092. Up to 91 conditions per place. [2022-12-11 20:50:54,009 INFO L137 encePairwiseOnDemand]: 79/92 looper letters, 33 selfloop transitions, 12 changer transitions 13/122 dead transitions. [2022-12-11 20:50:54,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 122 transitions, 910 flow [2022-12-11 20:50:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 20:50:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 20:50:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 807 transitions. [2022-12-11 20:50:54,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7309782608695652 [2022-12-11 20:50:54,025 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2022-12-11 20:50:54,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 122 transitions, 910 flow [2022-12-11 20:50:54,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 109 transitions, 746 flow [2022-12-11 20:50:54,027 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 109 transitions, 746 flow [2022-12-11 20:50:54,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.91666666666667) internal successors, (791), 12 states have internal predecessors, (791), 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 20:50:54,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:54,027 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] [2022-12-11 20:50:54,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:50:54,028 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 20:50:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:54,028 INFO L85 PathProgramCache]: Analyzing trace with hash 70002197, now seen corresponding path program 2 times [2022-12-11 20:50:54,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:54,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822830351] [2022-12-11 20:50:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:54,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:50:54,241 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 20:50:54,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:50:54,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822830351] [2022-12-11 20:50:54,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822830351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:50:54,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:50:54,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:50:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340816592] [2022-12-11 20:50:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:50:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:50:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:50:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:50:54,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:50:54,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 92 [2022-12-11 20:50:54,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 109 transitions, 746 flow. Second operand has 8 states, 8 states have (on average 67.75) internal successors, (542), 8 states have internal predecessors, (542), 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 20:50:54,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:50:54,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 92 [2022-12-11 20:50:54,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:50:54,371 INFO L130 PetriNetUnfolder]: 73/339 cut-off events. [2022-12-11 20:50:54,372 INFO L131 PetriNetUnfolder]: For 898/971 co-relation queries the response was YES. [2022-12-11 20:50:54,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 339 events. 73/339 cut-off events. For 898/971 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1698 event pairs, 19 based on Foata normal form. 5/341 useless extension candidates. Maximal degree in co-relation 1229. Up to 96 conditions per place. [2022-12-11 20:50:54,373 INFO L137 encePairwiseOnDemand]: 82/92 looper letters, 21 selfloop transitions, 5 changer transitions 40/123 dead transitions. [2022-12-11 20:50:54,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 123 transitions, 1022 flow [2022-12-11 20:50:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 20:50:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 20:50:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 555 transitions. [2022-12-11 20:50:54,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7540760869565217 [2022-12-11 20:50:54,375 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 23 predicate places. [2022-12-11 20:50:54,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 123 transitions, 1022 flow [2022-12-11 20:50:54,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 83 transitions, 498 flow [2022-12-11 20:50:54,376 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 83 transitions, 498 flow [2022-12-11 20:50:54,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.75) internal successors, (542), 8 states have internal predecessors, (542), 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 20:50:54,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:50:54,377 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] [2022-12-11 20:50:54,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:50:54,377 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 20:50:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:50:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 671602215, now seen corresponding path program 3 times [2022-12-11 20:50:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:50:54,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435086876] [2022-12-11 20:50:54,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:50:54,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:50:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:50:54,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 20:50:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:50:54,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 20:50:54,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 20:50:54,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-11 20:50:54,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-11 20:50:54,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-11 20:50:54,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-11 20:50:54,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-11 20:50:54,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:50:54,477 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-11 20:50:54,481 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 20:50:54,481 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 20:50:54,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 08:50:54 BasicIcfg [2022-12-11 20:50:54,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 20:50:54,536 INFO L158 Benchmark]: Toolchain (without parser) took 5916.60ms. Allocated memory was 181.4MB in the beginning and 379.6MB in the end (delta: 198.2MB). Free memory was 156.4MB in the beginning and 329.4MB in the end (delta: -173.0MB). Peak memory consumption was 182.1MB. Max. memory is 8.0GB. [2022-12-11 20:50:54,536 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:50:54,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.39ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 129.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 20:50:54,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.79ms. Allocated memory is still 181.4MB. Free memory was 129.3MB in the beginning and 126.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:50:54,536 INFO L158 Benchmark]: Boogie Preprocessor took 21.72ms. Allocated memory is still 181.4MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:50:54,537 INFO L158 Benchmark]: RCFGBuilder took 715.96ms. Allocated memory is still 181.4MB. Free memory was 125.1MB in the beginning and 88.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-11 20:50:54,537 INFO L158 Benchmark]: TraceAbstraction took 4641.27ms. Allocated memory was 181.4MB in the beginning and 379.6MB in the end (delta: 198.2MB). Free memory was 86.8MB in the beginning and 329.4MB in the end (delta: -242.6MB). Peak memory consumption was 112.9MB. Max. memory is 8.0GB. [2022-12-11 20:50:54,538 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.39ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 129.8MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.79ms. Allocated memory is still 181.4MB. Free memory was 129.3MB in the beginning and 126.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.72ms. Allocated memory is still 181.4MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 715.96ms. Allocated memory is still 181.4MB. Free memory was 125.1MB in the beginning and 88.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4641.27ms. Allocated memory was 181.4MB in the beginning and 379.6MB in the end (delta: 198.2MB). Free memory was 86.8MB in the beginning and 329.4MB in the end (delta: -242.6MB). Peak memory consumption was 112.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L717] 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 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L719] 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, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 pthread_t t0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t0, ((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, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 1 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 y$flush_delayed = weak$$choice2 [L796] 2 y$mem_tmp = y [L797] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L798] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L799] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L800] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L801] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L803] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = y [L805] 2 y = y$flush_delayed ? y$mem_tmp : y [L806] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L774] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L775] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L776] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L777] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 2 __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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __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, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] 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, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] 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, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() 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, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 834]: 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: 832]: 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, 112 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: 4.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 744 IncrementalHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 62 mSDtfsCounter, 744 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=746occurred in iteration=6, 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, 1850 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 442 ConstructedInterpolants, 0 QuantifiedInterpolants, 2548 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 20:50:54,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...