./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-ghost/mix009.opt.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 4a4c57e3
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i ./goblint.2024-09-02_08-21-23.files/protection-ghost/mix009.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m
[2024-09-08 12:52:12,616 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-09-08 12:52:12,707 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-09-08 12:52:12,716 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-09-08 12:52:12,716 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-09-08 12:52:12,744 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-09-08 12:52:12,745 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-09-08 12:52:12,745 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-09-08 12:52:12,746 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-09-08 12:52:12,748 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-09-08 12:52:12,748 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-09-08 12:52:12,749 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-09-08 12:52:12,749 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-09-08 12:52:12,751 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-09-08 12:52:12,751 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-09-08 12:52:12,752 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-09-08 12:52:12,752 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-09-08 12:52:12,752 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-09-08 12:52:12,753 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-09-08 12:52:12,753 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-09-08 12:52:12,753 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-09-08 12:52:12,756 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-09-08 12:52:12,756 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-09-08 12:52:12,756 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-09-08 12:52:12,757 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-09-08 12:52:12,757 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-09-08 12:52:12,757 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-09-08 12:52:12,757 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-09-08 12:52:12,758 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-09-08 12:52:12,758 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-09-08 12:52:12,758 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-09-08 12:52:12,758 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-09-08 12:52:12,759 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-09-08 12:52:12,759 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-09-08 12:52:12,760 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-09-08 12:52:12,761 INFO  L153        SettingsManager]:  * DFS Order used in POR=LOOP_LOCKSTEP
[2024-09-08 12:52:12,761 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-09-08 12:52:12,761 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-09-08 12:52:12,762 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-09-08 12:52:12,762 INFO  L153        SettingsManager]:  * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-09-08 12:52:12,762 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-09-08 12:52:12,763 INFO  L153        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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
[2024-09-08 12:52:13,026 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-09-08 12:52:13,049 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-09-08 12:52:13,053 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-09-08 12:52:13,054 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-09-08 12:52:13,055 INFO  L274        PluginConnector]: CDTParser initialized
[2024-09-08 12:52:13,056 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.opt.i
[2024-09-08 12:52:14,474 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-09-08 12:52:14,697 INFO  L384              CDTParser]: Found 1 translation units.
[2024-09-08 12:52:14,698 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i
[2024-09-08 12:52:14,714 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3465d70e3/684875a8b03c4947b120cd98acdde6b9/FLAGaf718d30f
[2024-09-08 12:52:14,732 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3465d70e3/684875a8b03c4947b120cd98acdde6b9
[2024-09-08 12:52:14,734 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-09-08 12:52:14,735 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-09-08 12:52:14,735 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-ghost/mix009.opt.yml/witness.yml
[2024-09-08 12:52:14,823 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-09-08 12:52:14,824 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-09-08 12:52:14,827 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-09-08 12:52:14,827 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-09-08 12:52:14,832 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-09-08 12:52:14,832 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:52:14" (1/2) ...
[2024-09-08 12:52:14,833 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b2238a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:52:14, skipping insertion in model container
[2024-09-08 12:52:14,833 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:52:14" (1/2) ...
[2024-09-08 12:52:14,835 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@67352fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:52:14, skipping insertion in model container
[2024-09-08 12:52:14,835 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 12:52:14" (2/2) ...
[2024-09-08 12:52:14,836 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b2238a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:14, skipping insertion in model container
[2024-09-08 12:52:14,836 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 12:52:14" (2/2) ...
[2024-09-08 12:52:14,915 INFO  L93    nessWitnessExtractor]: Found the following entries in the witness:
[2024-09-08 12:52:14,916 INFO  L1541             ArrayList]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))
[2024-09-08 12:52:14,916 INFO  L1541             ArrayList]: Location invariant before [L835-L835] (((((((((((((((((! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))
[2024-09-08 12:52:14,917 INFO  L1541             ArrayList]: ghost_variable multithreaded = 0
[2024-09-08 12:52:14,917 INFO  L1541             ArrayList]: ghost_update [L832-L832] multithreaded = 1;
[2024-09-08 12:52:14,964 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-09-08 12:52:15,152 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i[987,1000]
[2024-09-08 12:52:15,364 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-09-08 12:52:15,375 INFO  L200         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-09-08 12:52:15,412 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.opt.i[987,1000]
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-09-08 12:52:15,484 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-09-08 12:52:15,517 INFO  L204         MainTranslator]: Completed translation
[2024-09-08 12:52:15,517 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15 WrapperNode
[2024-09-08 12:52:15,518 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-09-08 12:52:15,519 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-09-08 12:52:15,519 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-09-08 12:52:15,519 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-09-08 12:52:15,526 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,566 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,629 INFO  L138                Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136
[2024-09-08 12:52:15,629 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-09-08 12:52:15,630 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-09-08 12:52:15,630 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-09-08 12:52:15,630 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-09-08 12:52:15,646 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,646 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,656 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,657 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,672 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,674 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,676 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,678 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,682 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-09-08 12:52:15,683 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-09-08 12:52:15,683 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-09-08 12:52:15,683 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-09-08 12:52:15,684 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (1/1) ...
[2024-09-08 12:52:15,696 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-09-08 12:52:15,705 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-09-08 12:52:15,725 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-09-08 12:52:15,729 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-09-08 12:52:15,783 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-09-08 12:52:15,784 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-09-08 12:52:15,785 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-09-08 12:52:15,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-09-08 12:52:15,786 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-09-08 12:52:15,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-09-08 12:52:15,786 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-09-08 12:52:15,786 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-09-08 12:52:15,786 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-09-08 12:52:15,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-09-08 12:52:15,788 WARN  L211             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-09-08 12:52:15,915 INFO  L242             CfgBuilder]: Building ICFG
[2024-09-08 12:52:15,916 INFO  L268             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-09-08 12:52:16,255 INFO  L287             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-09-08 12:52:16,255 INFO  L291             CfgBuilder]: Performing block encoding
[2024-09-08 12:52:16,471 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-09-08 12:52:16,472 INFO  L318             CfgBuilder]: Removed 0 assume(true) statements.
[2024-09-08 12:52:16,472 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:52:16 BoogieIcfgContainer
[2024-09-08 12:52:16,472 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-09-08 12:52:16,474 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-09-08 12:52:16,475 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-09-08 12:52:16,478 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-09-08 12:52:16,479 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:52:14" (1/4) ...
[2024-09-08 12:52:16,480 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585531d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:52:16, skipping insertion in model container
[2024-09-08 12:52:16,480 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 12:52:14" (2/4) ...
[2024-09-08 12:52:16,481 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585531d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 12:52:16, skipping insertion in model container
[2024-09-08 12:52:16,481 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 12:52:15" (3/4) ...
[2024-09-08 12:52:16,482 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585531d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 12:52:16, skipping insertion in model container
[2024-09-08 12:52:16,482 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:52:16" (4/4) ...
[2024-09-08 12:52:16,484 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix009.opt.i
[2024-09-08 12:52:16,498 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-09-08 12:52:16,498 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-09-08 12:52:16,498 INFO  L484   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-09-08 12:52:16,547 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-09-08 12:52:16,588 INFO  L100   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-08 12:52:16,588 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-09-08 12:52:16,589 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-09-08 12:52:16,590 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-09-08 12:52:16,593 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-09-08 12:52:16,633 INFO  L157   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-09-08 12:52:16,648 INFO  L335      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ========
[2024-09-08 12:52:16,656 INFO  L336      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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@72231913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-08 12:52:16,657 INFO  L337      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-09-08 12:52:16,809 INFO  L399      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-09-08 12:52:16,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:16,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -1540413881, now seen corresponding path program 1 times
[2024-09-08 12:52:16,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:16,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129613497]
[2024-09-08 12:52:16,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:16,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:16,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:17,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:17,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:17,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129613497]
[2024-09-08 12:52:17,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129613497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:17,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:17,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-09-08 12:52:17,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351591064]
[2024-09-08 12:52:17,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:17,437 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-09-08 12:52:17,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:17,463 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-09-08 12:52:17,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-09-08 12:52:17,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:17,467 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:17,468 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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)
[2024-09-08 12:52:17,468 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:18,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:18,504 INFO  L785   garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-09-08 12:52:18,505 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-09-08 12:52:18,513 INFO  L408         BasicCegarLoop]: Path program histogram: [1]
[2024-09-08 12:52:18,516 INFO  L312   ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2)
[2024-09-08 12:52:18,520 INFO  L100   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-08 12:52:18,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-09-08 12:52:18,523 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-09-08 12:52:18,541 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-09-08 12:52:18,543 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process
[2024-09-08 12:52:18,546 INFO  L157   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-09-08 12:52:18,547 INFO  L335      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-09-08 12:52:18,548 INFO  L336      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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@72231913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-09-08 12:52:18,550 INFO  L337      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-09-08 12:52:18,605 INFO  L399      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:18,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:18,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 352340402, now seen corresponding path program 1 times
[2024-09-08 12:52:18,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:18,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687242041]
[2024-09-08 12:52:18,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:18,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:18,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:19,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:19,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:19,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687242041]
[2024-09-08 12:52:19,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687242041] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:19,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:19,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-09-08 12:52:19,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383731399]
[2024-09-08 12:52:19,208 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:19,209 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-09-08 12:52:19,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:19,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-09-08 12:52:19,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-09-08 12:52:19,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:19,211 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:19,211 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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)
[2024-09-08 12:52:19,211 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:19,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:19,297 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-09-08 12:52:19,297 INFO  L399      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:19,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:19,297 INFO  L85        PathProgramCache]: Analyzing trace with hash 1425987448, now seen corresponding path program 1 times
[2024-09-08 12:52:19,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:19,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430496810]
[2024-09-08 12:52:19,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:19,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:19,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:20,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:20,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:20,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430496810]
[2024-09-08 12:52:20,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430496810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:20,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:20,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-09-08 12:52:20,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415159274]
[2024-09-08 12:52:20,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:20,073 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-09-08 12:52:20,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:20,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-09-08 12:52:20,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-09-08 12:52:20,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:20,075 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:20,075 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-09-08 12:52:20,076 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:20,076 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:20,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:20,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:20,310 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-09-08 12:52:20,311 INFO  L399      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:20,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:20,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -841943591, now seen corresponding path program 1 times
[2024-09-08 12:52:20,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:20,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081933412]
[2024-09-08 12:52:20,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:20,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:20,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:20,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:20,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:20,506 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081933412]
[2024-09-08 12:52:20,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081933412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:20,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:20,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-09-08 12:52:20,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651726228]
[2024-09-08 12:52:20,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:20,507 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-09-08 12:52:20,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:20,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-09-08 12:52:20,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-09-08 12:52:20,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:20,507 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:20,508 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-09-08 12:52:20,508 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:20,508 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:20,508 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:20,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:20,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:20,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:20,692 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-09-08 12:52:20,693 INFO  L399      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:20,693 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:20,693 INFO  L85        PathProgramCache]: Analyzing trace with hash 1338334299, now seen corresponding path program 1 times
[2024-09-08 12:52:20,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:20,693 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022560948]
[2024-09-08 12:52:20,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:20,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:20,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:20,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:20,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:20,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022560948]
[2024-09-08 12:52:20,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022560948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:20,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:20,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-09-08 12:52:20,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834153701]
[2024-09-08 12:52:20,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:20,936 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-09-08 12:52:20,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:20,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-09-08 12:52:20,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-09-08 12:52:20,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:20,938 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:20,938 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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)
[2024-09-08 12:52:20,938 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:20,938 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:20,938 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:20,938 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:21,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:21,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:21,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:21,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:21,157 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-09-08 12:52:21,158 INFO  L399      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:21,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:21,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -1946218674, now seen corresponding path program 1 times
[2024-09-08 12:52:21,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:21,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689808613]
[2024-09-08 12:52:21,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:21,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:21,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:23,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:23,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:23,098 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689808613]
[2024-09-08 12:52:23,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689808613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:23,098 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:23,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-09-08 12:52:23,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286835746]
[2024-09-08 12:52:23,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:23,100 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-09-08 12:52:23,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:23,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-09-08 12:52:23,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-09-08 12:52:23,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:23,102 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:23,103 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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)
[2024-09-08 12:52:23,103 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,103 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,103 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,103 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,103 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:23,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:23,314 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-09-08 12:52:23,314 INFO  L399      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:23,315 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:23,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -307207869, now seen corresponding path program 1 times
[2024-09-08 12:52:23,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:23,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414401622]
[2024-09-08 12:52:23,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:23,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:23,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:23,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:23,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:23,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414401622]
[2024-09-08 12:52:23,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414401622] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:23,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:23,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-09-08 12:52:23,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786974463]
[2024-09-08 12:52:23,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:23,558 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-09-08 12:52:23,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:23,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-09-08 12:52:23,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-09-08 12:52:23,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:23,561 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:23,562 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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)
[2024-09-08 12:52:23,562 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,562 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,562 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,562 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,562 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:23,562 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:23,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:23,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,693 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-09-08 12:52:23,693 INFO  L399      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:23,693 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:23,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 1372390085, now seen corresponding path program 1 times
[2024-09-08 12:52:23,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:23,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183325814]
[2024-09-08 12:52:23,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:23,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:23,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:23,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:23,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:23,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183325814]
[2024-09-08 12:52:23,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183325814] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:23,894 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:23,894 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-09-08 12:52:23,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861790994]
[2024-09-08 12:52:23,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:23,895 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-09-08 12:52:23,895 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:23,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-09-08 12:52:23,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-09-08 12:52:23,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:23,896 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:23,896 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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)
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:23,897 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:24,067 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:24,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:24,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:24,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:24,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:24,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:24,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:24,069 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-09-08 12:52:24,069 INFO  L399      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:24,069 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:24,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 30344038, now seen corresponding path program 1 times
[2024-09-08 12:52:24,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:24,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024529023]
[2024-09-08 12:52:24,069 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:24,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:24,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:25,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:25,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:25,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024529023]
[2024-09-08 12:52:25,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024529023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:25,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:25,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-09-08 12:52:25,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905832269]
[2024-09-08 12:52:25,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:25,562 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-09-08 12:52:25,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:25,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-09-08 12:52:25,563 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2024-09-08 12:52:25,563 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:25,563 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:25,563 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 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)
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:25,563 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:26,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:26,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:26,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:26,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:26,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:26,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:26,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:26,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-09-08 12:52:26,136 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-09-08 12:52:26,137 INFO  L399      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:26,137 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:26,137 INFO  L85        PathProgramCache]: Analyzing trace with hash -1859256280, now seen corresponding path program 2 times
[2024-09-08 12:52:26,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:26,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498338219]
[2024-09-08 12:52:26,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:26,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:26,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-09-08 12:52:27,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-09-08 12:52:27,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-09-08 12:52:27,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498338219]
[2024-09-08 12:52:27,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498338219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-09-08 12:52:27,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-09-08 12:52:27,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-09-08 12:52:27,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255931786]
[2024-09-08 12:52:27,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-09-08 12:52:27,667 INFO  L551      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-09-08 12:52:27,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-09-08 12:52:27,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-09-08 12:52:27,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-09-08 12:52:27,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:27,672 INFO  L474      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-09-08 12:52:27,672 INFO  L475      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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)
[2024-09-08 12:52:27,672 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:27,672 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. 
[2024-09-08 12:52:27,673 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-09-08 12:52:28,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-09-08 12:52:28,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-09-08 12:52:28,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-09-08 12:52:28,339 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-09-08 12:52:28,340 INFO  L399      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-09-08 12:52:28,340 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-09-08 12:52:28,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -1503105238, now seen corresponding path program 3 times
[2024-09-08 12:52:28,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-09-08 12:52:28,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822012984]
[2024-09-08 12:52:28,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-09-08 12:52:28,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-09-08 12:52:28,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-09-08 12:52:28,398 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-09-08 12:52:28,479 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-09-08 12:52:28,504 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-09-08 12:52:28,505 INFO  L326         BasicCegarLoop]: Counterexample is feasible
[2024-09-08 12:52:28,505 INFO  L785   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-09-08 12:52:28,505 INFO  L785   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining)
[2024-09-08 12:52:28,506 INFO  L785   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining)
[2024-09-08 12:52:28,506 INFO  L785   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-09-08 12:52:28,506 INFO  L785   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2024-09-08 12:52:28,506 WARN  L456      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-09-08 12:52:28,508 INFO  L408         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1]
[2024-09-08 12:52:28,508 INFO  L312   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2)
[2024-09-08 12:52:28,576 INFO  L234   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-09-08 12:52:28,576 INFO  L165   ceAbstractionStarter]: Computing trace abstraction results
[2024-09-08 12:52:28,580 INFO  L469   ceAbstractionStarter]: Automizer considered 2 witness invariants
[2024-09-08 12:52:28,580 INFO  L470   ceAbstractionStarter]: WitnessConsidered=2
[2024-09-08 12:52:28,582 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 12:52:28 BasicIcfg
[2024-09-08 12:52:28,582 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-09-08 12:52:28,583 INFO  L158              Benchmark]: Toolchain (without parser) took 13758.30ms. Allocated memory was 159.4MB in the beginning and 551.6MB in the end (delta: 392.2MB). Free memory was 99.5MB in the beginning and 403.6MB in the end (delta: -304.1MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,583 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 120.1MB in the end (delta: 148.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,583 INFO  L158              Benchmark]: Witness Parser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-09-08 12:52:28,583 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 691.33ms. Allocated memory is still 159.4MB. Free memory was 99.5MB in the beginning and 65.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,584 INFO  L158              Benchmark]: Boogie Procedure Inliner took 110.66ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 65.4MB in the beginning and 205.0MB in the end (delta: -139.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,584 INFO  L158              Benchmark]: Boogie Preprocessor took 52.35ms. Allocated memory is still 237.0MB. Free memory was 205.0MB in the beginning and 203.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,585 INFO  L158              Benchmark]: RCFGBuilder took 789.32ms. Allocated memory is still 237.0MB. Free memory was 203.1MB in the beginning and 142.2MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,585 INFO  L158              Benchmark]: TraceAbstraction took 12107.95ms. Allocated memory was 237.0MB in the beginning and 551.6MB in the end (delta: 314.6MB). Free memory was 141.2MB in the beginning and 403.6MB in the end (delta: -262.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB.
[2024-09-08 12:52:28,586 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory was 120.3MB in the beginning and 120.1MB in the end (delta: 148.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Witness Parser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 691.33ms. Allocated memory is still 159.4MB. Free memory was 99.5MB in the beginning and 65.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 110.66ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 65.4MB in the beginning and 205.0MB in the end (delta: -139.5MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 52.35ms. Allocated memory is still 237.0MB. Free memory was 205.0MB in the beginning and 203.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 789.32ms. Allocated memory is still 237.0MB. Free memory was 203.1MB in the beginning and 142.2MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 12107.95ms. Allocated memory was 237.0MB in the beginning and 551.6MB in the end (delta: 314.6MB). Free memory was 141.2MB in the beginning and 403.6MB in the end (delta: -262.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Partial order reduction statistics
    Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1095, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 117, dependent conditional: 78, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1074, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 96, dependent conditional: 57, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1074, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 96, dependent conditional: 57, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1169, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 191, dependent conditional: 152, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1169, independent: 978, independent conditional: 38, independent unconditional: 940, dependent: 191, dependent conditional: 44, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1169, independent: 978, independent conditional: 38, independent unconditional: 940, dependent: 191, dependent conditional: 44, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 512, independent: 463, independent conditional: 3, independent unconditional: 460, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 512, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 967, independent: 237, independent conditional: 45, independent unconditional: 192, dependent: 730, dependent conditional: 166, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1169, independent: 515, independent conditional: 35, independent unconditional: 480, dependent: 142, dependent conditional: 37, dependent unconditional: 105, unknown: 512, unknown conditional: 10, unknown unconditional: 502] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 463, Positive conditional cache size: 3, Positive unconditional cache size: 460, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 590, Maximal queried relation: 1, Independence queries for same thread: 21, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 117, Number of trivial persistent sets: 79, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 497, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1095, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 117, dependent conditional: 78, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1074, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 96, dependent conditional: 57, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1074, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 96, dependent conditional: 57, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1169, independent: 978, independent conditional: 520, independent unconditional: 458, dependent: 191, dependent conditional: 152, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1169, independent: 978, independent conditional: 38, independent unconditional: 940, dependent: 191, dependent conditional: 44, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1169, independent: 978, independent conditional: 38, independent unconditional: 940, dependent: 191, dependent conditional: 44, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 512, independent: 463, independent conditional: 3, independent unconditional: 460, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 512, independent: 444, independent conditional: 0, independent unconditional: 444, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 49, dependent conditional: 7, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 967, independent: 237, independent conditional: 45, independent unconditional: 192, dependent: 730, dependent conditional: 166, dependent unconditional: 564, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1169, independent: 515, independent conditional: 35, independent unconditional: 480, dependent: 142, dependent conditional: 37, dependent unconditional: 105, unknown: 512, unknown conditional: 10, unknown unconditional: 502] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 463, Positive conditional cache size: 3, Positive unconditional cache size: 460, Negative cache size: 49, Negative conditional cache size: 7, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 590, Maximal queried relation: 1, Independence queries for same thread: 21
  - StatisticsResult: Partial order reduction statistics
    Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1026, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 104, dependent conditional: 68, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 984, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 984, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1093, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 171, dependent conditional: 135, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1093, independent: 922, independent conditional: 14, independent unconditional: 908, dependent: 171, dependent conditional: 73, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1093, independent: 922, independent conditional: 14, independent unconditional: 908, dependent: 171, dependent conditional: 73, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 435, independent: 372, independent conditional: 6, independent unconditional: 366, dependent: 63, dependent conditional: 27, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 435, independent: 352, independent conditional: 0, independent unconditional: 352, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 63, dependent conditional: 27, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 63, dependent conditional: 27, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 823, independent: 115, independent conditional: 20, independent unconditional: 95, dependent: 708, dependent conditional: 249, dependent unconditional: 459, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1093, independent: 550, independent conditional: 8, independent unconditional: 542, dependent: 108, dependent conditional: 46, dependent unconditional: 62, unknown: 435, unknown conditional: 33, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 372, Positive conditional cache size: 6, Positive unconditional cache size: 366, Negative cache size: 63, Negative conditional cache size: 27, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 606, Maximal queried relation: 5, Independence queries for same thread: 42, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 125, Number of trivial persistent sets: 76, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1026, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 104, dependent conditional: 68, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 984, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 984, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 62, dependent conditional: 26, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1093, independent: 922, independent conditional: 558, independent unconditional: 364, dependent: 171, dependent conditional: 135, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1093, independent: 922, independent conditional: 14, independent unconditional: 908, dependent: 171, dependent conditional: 73, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1093, independent: 922, independent conditional: 14, independent unconditional: 908, dependent: 171, dependent conditional: 73, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 435, independent: 372, independent conditional: 6, independent unconditional: 366, dependent: 63, dependent conditional: 27, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 435, independent: 352, independent conditional: 0, independent unconditional: 352, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 63, dependent conditional: 27, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 63, dependent conditional: 27, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 823, independent: 115, independent conditional: 20, independent unconditional: 95, dependent: 708, dependent conditional: 249, dependent unconditional: 459, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1093, independent: 550, independent conditional: 8, independent unconditional: 542, dependent: 108, dependent conditional: 46, dependent unconditional: 62, unknown: 435, unknown conditional: 33, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 372, Positive conditional cache size: 6, Positive unconditional cache size: 366, Negative cache size: 63, Negative conditional cache size: 27, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 606, Maximal queried relation: 5, Independence queries for same thread: 42
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p0_EBX = 0;
[L715]               0  int __unbuffered_p1_EAX = 0;
[L717]               0  int __unbuffered_p1_EBX = 0;
[L718]               0  _Bool main$tmp_guard0;
[L719]               0  _Bool main$tmp_guard1;
[L721]               0  int x = 0;
[L723]               0  int y = 0;
[L724]               0  _Bool y$flush_delayed;
[L725]               0  int y$mem_tmp;
[L726]               0  _Bool y$r_buff0_thd0;
[L727]               0  _Bool y$r_buff0_thd1;
[L728]               0  _Bool y$r_buff0_thd2;
[L729]               0  _Bool y$r_buff1_thd0;
[L730]               0  _Bool y$r_buff1_thd1;
[L731]               0  _Bool y$r_buff1_thd2;
[L732]               0  _Bool y$read_delayed;
[L733]               0  int *y$read_delayed_var;
[L734]               0  int y$w_buff0;
[L735]               0  _Bool y$w_buff0_used;
[L736]               0  int y$w_buff1;
[L737]               0  _Bool y$w_buff1_used;
[L739]               0  int z = 0;
[L740]               0  _Bool weak$$choice0;
[L741]               0  _Bool weak$$choice2;
[L1]                 0  //@ ghost int multithreaded = 0;
[L831]               0  pthread_t t243;
[L832]               0  //@ ghost multithreaded = 1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L832]  FCALL, FORK  0  pthread_create(&t243, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L833]               0  pthread_t t244;
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L834]               0  //@ assert ((((((((((((((((((!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1))));
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L834]  FCALL, FORK  0  pthread_create(&t244, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243=-1, t244=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L779]               2  y$w_buff1 = y$w_buff0
[L780]               2  y$w_buff0 = 1
[L781]               2  y$w_buff1_used = y$w_buff0_used
[L782]               2  y$w_buff0_used = (_Bool)1
[L783]  CALL         2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L783]  RET          2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L784]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L785]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L786]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L787]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L790]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               2  y$flush_delayed = weak$$choice2
[L793]               2  y$mem_tmp = y
[L794]               2  y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L795]               2  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L796]               2  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L797]               2  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L798]               2  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L799]               2  y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L800]               2  y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L801]               2  __unbuffered_p1_EAX = y
[L802]               2  y = y$flush_delayed ? y$mem_tmp : y
[L803]               2  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L806]               2  __unbuffered_p1_EBX = z
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L835]               0  //@ assert ((((((((((((((((((!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (y$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1))));
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t243=-1, t244=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L745]               1  z = 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L748]               1  x = 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L751]               1  __unbuffered_p0_EAX = x
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EBX = y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L809]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L810]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L811]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L812]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L813]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L816]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L818]               2  return 0;
[L772]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L836]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243=-1, t244=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L838]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L838]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L840]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L841]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L842]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L843]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L844]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243=-1, t244=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L847]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243=-1, t244=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L849]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L19]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]

  - UnprovableResult [Line: 834]: Unable to prove that invariant of correctness witness holds
    Unable to prove that invariant of correctness witness holds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 835]: Unable to prove that invariant of correctness witness holds
    Unable to prove that invariant of correctness witness holds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork0 with 1 thread instances
    CFG has 5 procedures, 59 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, 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: 3, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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
  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
    CFG has 5 procedures, 59 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.5s, 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: 58, 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, 6.9s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 3456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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!
[2024-09-08 12:52:28,621 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0
[2024-09-08 12:52:28,821 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-09-08 12:52:29,019 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE