/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 19:44:14,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 19:44:14,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 19:44:14,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 19:44:14,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 19:44:14,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 19:44:14,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 19:44:14,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 19:44:14,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 19:44:14,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 19:44:14,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 19:44:14,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 19:44:14,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 19:44:14,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 19:44:14,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 19:44:14,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 19:44:14,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 19:44:14,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 19:44:14,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 19:44:14,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 19:44:14,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 19:44:14,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 19:44:14,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 19:44:14,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 19:44:14,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 19:44:14,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 19:44:14,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 19:44:14,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 19:44:14,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 19:44:14,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 19:44:14,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 19:44:14,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 19:44:14,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 19:44:14,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 19:44:14,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 19:44:14,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 19:44:14,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 19:44:14,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 19:44:14,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 19:44:14,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 19:44:14,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 19:44:14,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 19:44:15,020 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 19:44:15,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 19:44:15,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 19:44:15,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 19:44:15,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 19:44:15,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 19:44:15,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 19:44:15,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 19:44:15,022 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 19:44:15,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 19:44:15,023 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 19:44:15,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 19:44:15,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 19:44:15,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 19:44:15,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 19:44:15,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:44:15,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 19:44:15,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 19:44:15,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 19:44:15,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 19:44:15,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 19:44:15,026 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 19:44:15,026 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: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 19:44:15,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 19:44:15,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 19:44:15,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 19:44:15,252 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 19:44:15,253 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 19:44:15,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-05-04 19:44:15,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdae8b288/e181efc4a3914343be1f121a1f6489f4/FLAG1c5fbb6b9 [2023-05-04 19:44:15,822 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 19:44:15,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2023-05-04 19:44:15,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdae8b288/e181efc4a3914343be1f121a1f6489f4/FLAG1c5fbb6b9 [2023-05-04 19:44:16,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdae8b288/e181efc4a3914343be1f121a1f6489f4 [2023-05-04 19:44:16,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 19:44:16,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 19:44:16,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 19:44:16,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 19:44:16,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 19:44:16,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166ceb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16, skipping insertion in model container [2023-05-04 19:44:16,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 19:44:16,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 19:44:16,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2023-05-04 19:44:16,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:44:16,707 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 19:44:16,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i[949,962] [2023-05-04 19:44:16,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:44:16,785 INFO L208 MainTranslator]: Completed translation [2023-05-04 19:44:16,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16 WrapperNode [2023-05-04 19:44:16,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 19:44:16,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 19:44:16,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 19:44:16,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 19:44:16,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,852 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-05-04 19:44:16,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 19:44:16,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 19:44:16,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 19:44:16,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 19:44:16,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 19:44:16,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 19:44:16,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 19:44:16,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 19:44:16,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (1/1) ... [2023-05-04 19:44:16,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:44:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:44:16,947 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) [2023-05-04 19:44:16,979 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 [2023-05-04 19:44:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 19:44:16,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-05-04 19:44:16,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-05-04 19:44:16,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-05-04 19:44:16,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 19:44:16,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 19:44:16,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 19:44:16,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 19:44:16,993 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 19:44:17,177 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 19:44:17,181 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 19:44:17,407 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 19:44:17,540 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 19:44:17,540 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-04 19:44:17,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:44:17 BoogieIcfgContainer [2023-05-04 19:44:17,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 19:44:17,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 19:44:17,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 19:44:17,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 19:44:17,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:44:16" (1/3) ... [2023-05-04 19:44:17,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483a052e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:44:17, skipping insertion in model container [2023-05-04 19:44:17,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:44:16" (2/3) ... [2023-05-04 19:44:17,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483a052e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:44:17, skipping insertion in model container [2023-05-04 19:44:17,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:44:17" (3/3) ... [2023-05-04 19:44:17,548 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2023-05-04 19:44:17,554 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 19:44:17,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 19:44:17,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-04 19:44:17,561 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 19:44:17,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 19:44:17,705 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:44:17,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:44:17,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:44:17,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 19:44:17,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 19:44:17,795 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:44:17,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 19:44:17,856 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@558f51ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:44:17,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 19:44:18,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash -947706699, now seen corresponding path program 1 times [2023-05-04 19:44:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:18,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641400782] [2023-05-04 19:44:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641400782] [2023-05-04 19:44:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641400782] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:44:18,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:44:18,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 19:44:18,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867225021] [2023-05-04 19:44:18,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:44:18,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 19:44:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:18,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 19:44:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 19:44:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:18,362 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:18,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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) [2023-05-04 19:44:18,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:18,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 19:44:18,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash -474579748, now seen corresponding path program 1 times [2023-05-04 19:44:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:18,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82830282] [2023-05-04 19:44:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:18,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:19,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82830282] [2023-05-04 19:44:19,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82830282] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:44:19,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:44:19,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 19:44:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291010772] [2023-05-04 19:44:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:44:19,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 19:44:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 19:44:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-05-04 19:44:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:19,121 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:19,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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) [2023-05-04 19:44:19,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:19,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:19,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 19:44:19,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1270032994, now seen corresponding path program 1 times [2023-05-04 19:44:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:19,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055132752] [2023-05-04 19:44:19,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:20,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055132752] [2023-05-04 19:44:20,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055132752] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:44:20,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:44:20,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 19:44:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244312837] [2023-05-04 19:44:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:44:20,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 19:44:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 19:44:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 19:44:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:20,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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) [2023-05-04 19:44:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:20,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:20,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 19:44:20,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1160936290, now seen corresponding path program 2 times [2023-05-04 19:44:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:20,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566023913] [2023-05-04 19:44:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:20,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566023913] [2023-05-04 19:44:20,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566023913] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:44:20,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:44:20,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-05-04 19:44:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874630060] [2023-05-04 19:44:20,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:44:20,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 19:44:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 19:44:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-05-04 19:44:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,405 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:20,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 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) [2023-05-04 19:44:20,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:20,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:44:20,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 19:44:20,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash -652925806, now seen corresponding path program 1 times [2023-05-04 19:44:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268716363] [2023-05-04 19:44:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:20,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:20,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268716363] [2023-05-04 19:44:20,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268716363] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:44:20,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:44:20,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 19:44:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154102971] [2023-05-04 19:44:20,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:44:20,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 19:44:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 19:44:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-05-04 19:44:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,831 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:20,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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) [2023-05-04 19:44:20,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:20,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:20,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:20,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:44:20,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:44:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 19:44:21,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash 235213228, now seen corresponding path program 2 times [2023-05-04 19:44:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:21,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137727756] [2023-05-04 19:44:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:44:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:44:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:44:22,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137727756] [2023-05-04 19:44:22,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137727756] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:44:22,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:44:22,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-05-04 19:44:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479581452] [2023-05-04 19:44:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:44:22,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-04 19:44:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:44:22,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-04 19:44:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-05-04 19:44:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:22,451 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:44:22,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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) [2023-05-04 19:44:22,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:22,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:22,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:22,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:44:22,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:22,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:44:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 19:44:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 19:44:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 19:44:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-05-04 19:44:22,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 19:44:22,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-04 19:44:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:44:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 73982380, now seen corresponding path program 3 times [2023-05-04 19:44:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:44:22,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488993334] [2023-05-04 19:44:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:44:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:44:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 19:44:22,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 19:44:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 19:44:22,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 19:44:22,949 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 19:44:22,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 19:44:22,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-04 19:44:22,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-04 19:44:22,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-04 19:44:22,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 19:44:22,956 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-05-04 19:44:22,957 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-05-04 19:44:22,959 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 19:44:22,959 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 19:44:23,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 07:44:23 BasicIcfg [2023-05-04 19:44:23,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 19:44:23,052 INFO L158 Benchmark]: Toolchain (without parser) took 6754.87ms. Allocated memory was 209.7MB in the beginning and 445.6MB in the end (delta: 235.9MB). Free memory was 177.5MB in the beginning and 398.2MB in the end (delta: -220.7MB). Peak memory consumption was 259.0MB. Max. memory is 8.0GB. [2023-05-04 19:44:23,053 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 19:44:23,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.23ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 177.3MB in the beginning and 291.4MB in the end (delta: -114.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2023-05-04 19:44:23,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.67ms. Allocated memory is still 335.5MB. Free memory was 291.4MB in the beginning and 288.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 19:44:23,053 INFO L158 Benchmark]: Boogie Preprocessor took 31.41ms. Allocated memory is still 335.5MB. Free memory was 288.9MB in the beginning and 286.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 19:44:23,054 INFO L158 Benchmark]: RCFGBuilder took 652.20ms. Allocated memory is still 335.5MB. Free memory was 286.8MB in the beginning and 251.9MB in the end (delta: 34.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-05-04 19:44:23,054 INFO L158 Benchmark]: TraceAbstraction took 5508.29ms. Allocated memory was 335.5MB in the beginning and 445.6MB in the end (delta: 110.1MB). Free memory was 250.5MB in the beginning and 398.2MB in the end (delta: -147.7MB). Peak memory consumption was 208.3MB. Max. memory is 8.0GB. [2023-05-04 19:44:23,055 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.10ms. Allocated memory is still 209.7MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.23ms. Allocated memory was 209.7MB in the beginning and 335.5MB in the end (delta: 125.8MB). Free memory was 177.3MB in the beginning and 291.4MB in the end (delta: -114.2MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.67ms. Allocated memory is still 335.5MB. Free memory was 291.4MB in the beginning and 288.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.41ms. Allocated memory is still 335.5MB. Free memory was 288.9MB in the beginning and 286.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 652.20ms. Allocated memory is still 335.5MB. Free memory was 286.8MB in the beginning and 251.9MB in the end (delta: 34.9MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5508.29ms. Allocated memory was 335.5MB in the beginning and 445.6MB in the end (delta: 110.1MB). Free memory was 250.5MB in the beginning and 398.2MB in the end (delta: -147.7MB). Peak memory consumption was 208.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10414, independent: 8880, independent conditional: 7201, independent unconditional: 1679, dependent: 1534, dependent conditional: 1486, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9094, independent: 8880, independent conditional: 7201, independent unconditional: 1679, dependent: 214, dependent conditional: 166, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9094, independent: 8880, independent conditional: 7201, independent unconditional: 1679, dependent: 214, dependent conditional: 166, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10447, independent: 8880, independent conditional: 364, independent unconditional: 8516, dependent: 1567, dependent conditional: 989, dependent unconditional: 578, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10447, independent: 8880, independent conditional: 364, independent unconditional: 8516, dependent: 1567, dependent conditional: 96, dependent unconditional: 1471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10447, independent: 8880, independent conditional: 364, independent unconditional: 8516, dependent: 1567, dependent conditional: 96, dependent unconditional: 1471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1761, independent: 1695, independent conditional: 16, independent unconditional: 1679, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1761, independent: 1671, independent conditional: 0, independent unconditional: 1671, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 586, independent: 125, independent conditional: 73, independent unconditional: 52, dependent: 460, dependent conditional: 113, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10447, independent: 7185, independent conditional: 348, independent unconditional: 6837, dependent: 1501, dependent conditional: 81, dependent unconditional: 1420, unknown: 1761, unknown conditional: 31, unknown unconditional: 1730] , Statistics on independence cache: Total cache size (in pairs): 1761, Positive cache size: 1695, Positive conditional cache size: 16, Positive unconditional cache size: 1679, Negative cache size: 66, Negative conditional cache size: 15, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 893, Maximal queried relation: 5, Independence queries for same thread: 1320 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 673, Number of trivial persistent sets: 421, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1727, independent: 1679, independent conditional: 0, independent unconditional: 1679, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10414, independent: 8880, independent conditional: 7201, independent unconditional: 1679, dependent: 1534, dependent conditional: 1486, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9094, independent: 8880, independent conditional: 7201, independent unconditional: 1679, dependent: 214, dependent conditional: 166, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9094, independent: 8880, independent conditional: 7201, independent unconditional: 1679, dependent: 214, dependent conditional: 166, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10447, independent: 8880, independent conditional: 364, independent unconditional: 8516, dependent: 1567, dependent conditional: 989, dependent unconditional: 578, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10447, independent: 8880, independent conditional: 364, independent unconditional: 8516, dependent: 1567, dependent conditional: 96, dependent unconditional: 1471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10447, independent: 8880, independent conditional: 364, independent unconditional: 8516, dependent: 1567, dependent conditional: 96, dependent unconditional: 1471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1761, independent: 1695, independent conditional: 16, independent unconditional: 1679, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1761, independent: 1671, independent conditional: 0, independent unconditional: 1671, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 90, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 586, independent: 125, independent conditional: 73, independent unconditional: 52, dependent: 460, dependent conditional: 113, dependent unconditional: 347, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10447, independent: 7185, independent conditional: 348, independent unconditional: 6837, dependent: 1501, dependent conditional: 81, dependent unconditional: 1420, unknown: 1761, unknown conditional: 31, unknown unconditional: 1730] , Statistics on independence cache: Total cache size (in pairs): 1761, Positive cache size: 1695, Positive conditional cache size: 16, Positive unconditional cache size: 1679, Negative cache size: 66, Negative conditional cache size: 15, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 893, Maximal queried relation: 5, Independence queries for same thread: 1320 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0] [L731] 0 int *x$read_delayed_var; VAL [__unbuffered_p2_EBX=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L721] 0 int x$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L725] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L730] 0 _Bool x$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L735] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L733] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L732] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L734] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L727] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L726] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L729] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t515; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-2, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 2157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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! [2023-05-04 19:44:23,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 19:44:23,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...