This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-16 12:42:47,277 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-16 12:42:47,356 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-16 12:42:47,366 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-16 12:42:47,367 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-16 12:42:47,395 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-16 12:42:47,399 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-16 12:42:47,400 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-16 12:42:47,400 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-16 12:42:47,401 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-16 12:42:47,401 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-16 12:42:47,402 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-16 12:42:47,402 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-16 12:42:47,402 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-16 12:42:47,403 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-16 12:42:47,403 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-16 12:42:47,406 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-16 12:42:47,406 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-16 12:42:47,406 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-16 12:42:47,406 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-16 12:42:47,407 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-16 12:42:47,407 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-16 12:42:47,408 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-16 12:42:47,408 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-16 12:42:47,409 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-16 12:42:47,409 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-16 12:42:47,409 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-16 12:42:47,409 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-16 12:42:47,410 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-16 12:42:47,410 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-16 12:42:47,410 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 12:42:47,410 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-16 12:42:47,411 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-16 12:42:47,411 INFO  L153        SettingsManager]:  * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-16 12:42:47,411 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-16 12:42:47,411 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-16 12:42:47,411 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-16 12:42:47,412 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-16 12:42:47,412 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-16 12:42:47,412 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-16 12:42:47,413 INFO  L153        SettingsManager]:  * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-16 12:42:47,413 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19a854e56177f3540c5827f949efdd83ec94b87c6cd0ec772115563b836c4c8b
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> SYMBOLIC_RELATION
[2024-10-16 12:42:47,765 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-16 12:42:47,787 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-16 12:42:47,790 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-16 12:42:47,791 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-16 12:42:47,791 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-16 12:42:47,792 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016.oepc.i
[2024-10-16 12:42:49,258 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-16 12:42:49,539 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-16 12:42:49,539 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016.oepc.i
[2024-10-16 12:42:49,564 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5782abf0b/8ce0ab1c430b4419a34931cce69a507d/FLAG96b291b71
[2024-10-16 12:42:49,581 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5782abf0b/8ce0ab1c430b4419a34931cce69a507d
[2024-10-16 12:42:49,584 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-16 12:42:49,586 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-16 12:42:49,588 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-16 12:42:49,589 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-16 12:42:49,595 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-16 12:42:49,598 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:42:49" (1/1) ...
[2024-10-16 12:42:49,599 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcf0458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:49, skipping insertion in model container
[2024-10-16 12:42:49,599 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:42:49" (1/1) ...
[2024-10-16 12:42:49,647 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-16 12:42:49,851 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/mix016.oepc.i[945,958]
[2024-10-16 12:42:50,052 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-16 12:42:50,066 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-16 12:42:50,078 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/mix016.oepc.i[945,958]
[2024-10-16 12:42:50,135 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-16 12:42:50,176 INFO  L204         MainTranslator]: Completed translation
[2024-10-16 12:42:50,177 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50 WrapperNode
[2024-10-16 12:42:50,177 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-16 12:42:50,178 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-16 12:42:50,178 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-16 12:42:50,178 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-16 12:42:50,184 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,203 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,231 INFO  L138                Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117
[2024-10-16 12:42:50,232 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-16 12:42:50,232 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-16 12:42:50,232 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-16 12:42:50,233 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-16 12:42:50,244 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,245 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,248 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,248 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,257 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,259 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,261 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,263 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,266 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-16 12:42:50,267 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-16 12:42:50,267 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-16 12:42:50,267 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-16 12:42:50,268 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (1/1) ...
[2024-10-16 12:42:50,279 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 12:42:50,294 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 12:42:50,308 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-10-16 12:42:50,311 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-10-16 12:42:50,354 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-16 12:42:50,354 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-16 12:42:50,354 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-10-16 12:42:50,354 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-10-16 12:42:50,355 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-10-16 12:42:50,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-10-16 12:42:50,355 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-10-16 12:42:50,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-10-16 12:42:50,355 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-16 12:42:50,355 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-16 12:42:50,355 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-16 12:42:50,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-16 12:42:50,356 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-16 12:42:50,505 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-16 12:42:50,508 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-16 12:42:50,899 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-16 12:42:50,899 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-16 12:42:51,104 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-16 12:42:51,104 INFO  L314             CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-16 12:42:51,105 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:42:51 BoogieIcfgContainer
[2024-10-16 12:42:51,105 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-16 12:42:51,108 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-16 12:42:51,109 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-16 12:42:51,112 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-16 12:42:51,113 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:42:49" (1/3) ...
[2024-10-16 12:42:51,113 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b6e08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:42:51, skipping insertion in model container
[2024-10-16 12:42:51,114 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:42:50" (2/3) ...
[2024-10-16 12:42:51,115 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b6e08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:42:51, skipping insertion in model container
[2024-10-16 12:42:51,115 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:42:51" (3/3) ...
[2024-10-16 12:42:51,116 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix016.oepc.i
[2024-10-16 12:42:51,134 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-16 12:42:51,135 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-16 12:42:51,136 INFO  L484   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-16 12:42:51,187 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-16 12:42:51,233 INFO  L106   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-16 12:42:51,233 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-16 12:42:51,234 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 12:42:51,235 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-10-16 12:42:51,237 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-10-16 12:42:51,338 INFO  L194   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-16 12:42:51,361 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:42:51,363 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-16 12:42:51,369 INFO  L333      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=LoopHeads, 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;@27eae04c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-16 12:42:51,369 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-10-16 12:43:15,002 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:43:15,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:43:15,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 850786999, now seen corresponding path program 1 times
[2024-10-16 12:43:15,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 12:43:15,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950609745]
[2024-10-16 12:43:15,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:43:15,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:43:15,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:43:15,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:43:15,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 12:43:15,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950609745]
[2024-10-16 12:43:15,899 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950609745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 12:43:15,899 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 12:43:15,899 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-16 12:43:15,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741181919]
[2024-10-16 12:43:15,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 12:43:15,904 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 12:43:15,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 12:43:15,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 12:43:15,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-16 12:43:15,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:43:15,934 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 12:43:15,935 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 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-10-16 12:43:15,936 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:43:19,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:43:19,692 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-16 12:43:19,692 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:43:19,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -2024185651, now seen corresponding path program 1 times
[2024-10-16 12:43:19,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:43:19,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:43:19,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:43:19,844 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:43:19,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:43:19,983 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:43:19,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -1782185645, now seen corresponding path program 1 times
[2024-10-16 12:43:19,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 12:43:19,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147168689]
[2024-10-16 12:43:19,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:43:19,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:43:20,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:43:21,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:43:21,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 12:43:21,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147168689]
[2024-10-16 12:43:21,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147168689] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 12:43:21,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 12:43:21,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-10-16 12:43:21,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260097043]
[2024-10-16 12:43:21,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 12:43:21,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-16 12:43:21,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 12:43:21,034 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-16 12:43:21,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-10-16 12:43:21,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:43:21,035 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 12:43:21,036 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-10-16 12:43:21,037 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:43:21,037 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:43:30,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:43:30,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-10-16 12:43:30,804 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1
[2024-10-16 12:43:30,804 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:43:32,995 INFO  L85        PathProgramCache]: Analyzing trace with hash 208025553, now seen corresponding path program 1 times
[2024-10-16 12:43:32,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:43:32,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:43:33,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:43:33,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:43:33,955 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:43:33,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:43:33,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:43:34,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:43:34,784 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-16 12:43:34,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-16 12:43:34,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2024-10-16 12:43:34,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:43:34,786 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 12:43:34,786 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 4.5) internal successors, (18), 3 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-10-16 12:43:34,786 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:43:34,786 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. 
[2024-10-16 12:43:34,786 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:44:04,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:44:04,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-10-16 12:44:04,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:44:04,596 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3
[2024-10-16 12:44:04,596 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:44:48,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 2133684935, now seen corresponding path program 1 times
[2024-10-16 12:44:48,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:44:48,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:44:48,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:44:48,800 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:44:48,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:44:48,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -167722680, now seen corresponding path program 1 times
[2024-10-16 12:44:48,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:44:48,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:44:48,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:44:48,955 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:44:49,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:44:49,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:44:49,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 1993942423, now seen corresponding path program 2 times
[2024-10-16 12:44:49,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 12:44:49,022 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416066663]
[2024-10-16 12:44:49,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:44:49,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:44:49,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:44:49,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:44:49,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 12:44:49,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416066663]
[2024-10-16 12:44:49,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416066663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 12:44:49,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 12:44:49,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-16 12:44:49,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752427791]
[2024-10-16 12:44:49,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 12:44:49,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 12:44:49,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 12:44:49,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 12:44:49,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 12:44:49,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:44:49,334 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 12:44:49,335 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-10-16 12:44:49,335 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:44:49,335 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. 
[2024-10-16 12:44:49,336 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:44:49,336 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:45:47,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:47,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-10-16 12:45:47,297 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:45:47,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:47,298 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5
[2024-10-16 12:45:47,298 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:45:47,313 INFO  L85        PathProgramCache]: Analyzing trace with hash -307150422, now seen corresponding path program 1 times
[2024-10-16 12:45:47,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:45:47,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:45:47,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:47,345 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:45:47,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:47,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 993272510, now seen corresponding path program 1 times
[2024-10-16 12:45:47,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:45:47,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:45:47,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:47,514 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:45:47,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:47,561 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:45:47,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 2126296233, now seen corresponding path program 3 times
[2024-10-16 12:45:47,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 12:45:47,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358466192]
[2024-10-16 12:45:47,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:45:47,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:45:47,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:45:47,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:45:47,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 12:45:47,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358466192]
[2024-10-16 12:45:47,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358466192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 12:45:47,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 12:45:47,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-16 12:45:47,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109994217]
[2024-10-16 12:45:47,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 12:45:47,858 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 12:45:47,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 12:45:47,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 12:45:47,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 12:45:47,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:45:47,860 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 12:45:47,860 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-10-16 12:45:47,860 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:47,860 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2024-10-16 12:45:47,860 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:45:47,861 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:47,861 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:45:48,183 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:48,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-10-16 12:45:48,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:45:48,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:48,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 12:45:48,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9
[2024-10-16 12:45:48,185 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:45:48,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 401124660, now seen corresponding path program 1 times
[2024-10-16 12:45:48,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:45:48,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:45:48,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:48,209 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:45:48,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:48,282 INFO  L85        PathProgramCache]: Analyzing trace with hash -1685567986, now seen corresponding path program 1 times
[2024-10-16 12:45:48,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:45:48,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:45:48,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:48,330 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:45:48,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:45:48,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:45:48,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 953883877, now seen corresponding path program 4 times
[2024-10-16 12:45:48,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 12:45:48,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780928114]
[2024-10-16 12:45:48,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:45:48,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:45:48,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 12:45:49,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 12:45:49,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 12:45:49,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780928114]
[2024-10-16 12:45:49,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780928114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 12:45:49,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 12:45:49,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-10-16 12:45:49,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254055201]
[2024-10-16 12:45:49,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 12:45:49,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-10-16 12:45:49,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 12:45:49,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-10-16 12:45:49,063 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-10-16 12:45:49,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:45:49,063 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 12:45:49,063 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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-10-16 12:45:49,063 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:49,063 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2024-10-16 12:45:49,064 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:45:49,064 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:45:49,064 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 12:45:49,064 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 12:47:30,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:47:30,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-10-16 12:47:30,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-10-16 12:47:30,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 12:47:30,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 12:47:30,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-10-16 12:47:30,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13
[2024-10-16 12:47:30,601 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 12:47:30,615 INFO  L85        PathProgramCache]: Analyzing trace with hash 241148211, now seen corresponding path program 1 times
[2024-10-16 12:47:30,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:47:30,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:47:30,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:47:30,624 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:47:30,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:47:30,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 1638072944, now seen corresponding path program 1 times
[2024-10-16 12:47:30,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:47:30,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:47:30,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:47:30,733 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:47:30,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:47:30,788 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 12:47:30,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 1784469123, now seen corresponding path program 5 times
[2024-10-16 12:47:30,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 12:47:30,789 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142209582]
[2024-10-16 12:47:30,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 12:47:30,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 12:47:30,845 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:47:30,845 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 12:47:30,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 12:47:30,897 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-16 12:47:30,898 INFO  L332         BasicCegarLoop]: Counterexample is feasible
[2024-10-16 12:47:30,899 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2024-10-16 12:47:30,904 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2024-10-16 12:47:30,904 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2024-10-16 12:47:30,904 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2024-10-16 12:47:30,905 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16
[2024-10-16 12:47:30,916 INFO  L414         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-16 12:47:30,921 INFO  L312   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2)
[2024-10-16 12:47:31,022 INFO  L234   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-16 12:47:31,022 INFO  L165   ceAbstractionStarter]: Computing trace abstraction results
[2024-10-16 12:47:31,025 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:47:31 BasicIcfg
[2024-10-16 12:47:31,027 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-16 12:47:31,027 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-16 12:47:31,027 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-10-16 12:47:31,028 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-10-16 12:47:31,028 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:42:51" (3/4) ...
[2024-10-16 12:47:31,029 INFO  L133         WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-16 12:47:31,141 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-16 12:47:31,141 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-16 12:47:31,141 INFO  L158              Benchmark]: Toolchain (without parser) took 281555.02ms. Allocated memory was 71.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 49.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 284.6MB. Max. memory is 16.1GB.
[2024-10-16 12:47:31,142 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 46.1MB. Free memory was 27.3MB in the beginning and 27.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-16 12:47:31,142 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 589.04ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 43.8MB in the end (delta: 5.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB.
[2024-10-16 12:47:31,142 INFO  L158              Benchmark]: Boogie Procedure Inliner took 53.74ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 41.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-10-16 12:47:31,142 INFO  L158              Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 39.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-16 12:47:31,143 INFO  L158              Benchmark]: RCFGBuilder took 838.84ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 39.1MB in the beginning and 53.3MB in the end (delta: -14.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB.
[2024-10-16 12:47:31,143 INFO  L158              Benchmark]: TraceAbstraction took 279918.44ms. Allocated memory was 86.0MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 52.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 258.2MB. Max. memory is 16.1GB.
[2024-10-16 12:47:31,143 INFO  L158              Benchmark]: Witness Printer took 113.51ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-10-16 12:47:31,147 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.10ms. Allocated memory is still 46.1MB. Free memory was 27.3MB in the beginning and 27.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 589.04ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 43.8MB in the end (delta: 5.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 53.74ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 41.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 34.01ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 39.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 838.84ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 39.1MB in the beginning and 53.3MB in the end (delta: -14.2MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 279918.44ms. Allocated memory was 86.0MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 52.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 258.2MB. Max. memory is 16.1GB.
 * Witness Printer took 113.51ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. 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: 17511, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 1092, dependent conditional: 1053, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17178, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 759, dependent conditional: 721, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17178, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 759, dependent conditional: 721, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17178, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 759, dependent conditional: 721, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 7239, dependent conditional: 7163, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 770, independent: 697, independent conditional: 31, independent unconditional: 666, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 770, independent: 658, independent conditional: 0, independent unconditional: 658, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232195, independent: 72901, independent conditional: 72723, independent unconditional: 178, dependent: 159293, dependent conditional: 89384, dependent unconditional: 69909, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23658, independent: 15722, independent conditional: 1000, independent unconditional: 14722, dependent: 7166, dependent conditional: 720, dependent unconditional: 6446, unknown: 770, unknown conditional: 63, unknown unconditional: 707] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 697, Positive conditional cache size: 31, Positive unconditional cache size: 666, Negative cache size: 73, Negative conditional cache size: 32, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21133, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 7239, dependent conditional: 7163, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 770, independent: 697, independent conditional: 31, independent unconditional: 666, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 770, independent: 658, independent conditional: 0, independent unconditional: 658, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232195, independent: 72901, independent conditional: 72723, independent unconditional: 178, dependent: 159293, dependent conditional: 89384, dependent unconditional: 69909, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23658, independent: 15722, independent conditional: 1000, independent unconditional: 14722, dependent: 7166, dependent conditional: 720, dependent unconditional: 6446, unknown: 770, unknown conditional: 63, unknown unconditional: 707] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 697, Positive conditional cache size: 31, Positive unconditional cache size: 666, Negative cache size: 73, Negative conditional cache size: 32, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21133 ], Independence queries for same thread: 333, Persistent sets #1 benchmarks: Persistent set computation time: 67.9s, Number of persistent set computation: 859, Number of trivial persistent sets: 551, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 704, independent: 666, independent conditional: 0, independent unconditional: 666, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17511, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 1092, dependent conditional: 1053, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17178, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 759, dependent conditional: 721, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17178, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 759, dependent conditional: 721, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17178, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 759, dependent conditional: 721, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 7239, dependent conditional: 7163, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 770, independent: 697, independent conditional: 31, independent unconditional: 666, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 770, independent: 658, independent conditional: 0, independent unconditional: 658, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232195, independent: 72901, independent conditional: 72723, independent unconditional: 178, dependent: 159293, dependent conditional: 89384, dependent unconditional: 69909, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23658, independent: 15722, independent conditional: 1000, independent unconditional: 14722, dependent: 7166, dependent conditional: 720, dependent unconditional: 6446, unknown: 770, unknown conditional: 63, unknown unconditional: 707] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 697, Positive conditional cache size: 31, Positive unconditional cache size: 666, Negative cache size: 73, Negative conditional cache size: 32, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21133, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 15753, independent unconditional: 666, dependent: 7239, dependent conditional: 7163, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23658, independent: 16419, independent conditional: 1031, independent unconditional: 15388, dependent: 7239, dependent conditional: 752, dependent unconditional: 6487, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 770, independent: 697, independent conditional: 31, independent unconditional: 666, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 770, independent: 658, independent conditional: 0, independent unconditional: 658, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 112, independent: 39, independent conditional: 31, independent unconditional: 8, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 232195, independent: 72901, independent conditional: 72723, independent unconditional: 178, dependent: 159293, dependent conditional: 89384, dependent unconditional: 69909, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23658, independent: 15722, independent conditional: 1000, independent unconditional: 14722, dependent: 7166, dependent conditional: 720, dependent unconditional: 6446, unknown: 770, unknown conditional: 63, unknown unconditional: 707] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 697, Positive conditional cache size: 31, Positive unconditional cache size: 666, Negative cache size: 73, Negative conditional cache size: 32, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21133 ], Independence queries for same thread: 333
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p1_EAX = 0;
[L715]               0  int __unbuffered_p2_EAX = 0;
[L717]               0  int __unbuffered_p2_EBX = 0;
[L718]               0  _Bool main$tmp_guard0;
[L719]               0  _Bool main$tmp_guard1;
[L721]               0  int x = 0;
[L723]               0  int y = 0;
[L725]               0  int z = 0;
[L726]               0  _Bool z$flush_delayed;
[L727]               0  int z$mem_tmp;
[L728]               0  _Bool z$r_buff0_thd0;
[L729]               0  _Bool z$r_buff0_thd1;
[L730]               0  _Bool z$r_buff0_thd2;
[L731]               0  _Bool z$r_buff0_thd3;
[L732]               0  _Bool z$r_buff1_thd0;
[L733]               0  _Bool z$r_buff1_thd1;
[L734]               0  _Bool z$r_buff1_thd2;
[L735]               0  _Bool z$r_buff1_thd3;
[L736]               0  _Bool z$read_delayed;
[L737]               0  int *z$read_delayed_var;
[L738]               0  int z$w_buff0;
[L739]               0  _Bool z$w_buff0_used;
[L740]               0  int z$w_buff1;
[L741]               0  _Bool z$w_buff1_used;
[L742]               0  _Bool weak$$choice0;
[L743]               0  _Bool weak$$choice2;
[L840]               0  pthread_t t409;
[L841]  FCALL, FORK  0  pthread_create(&t409, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L842]               0  pthread_t t410;
[L843]  FCALL, FORK  0  pthread_create(&t410, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t409=-3, t410=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L844]               0  pthread_t t411;
[L845]  FCALL, FORK  0  pthread_create(&t411, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L747]               1  z$w_buff1 = z$w_buff0
[L748]               1  z$w_buff0 = 1
[L749]               1  z$w_buff1_used = z$w_buff0_used
[L750]               1  z$w_buff0_used = (_Bool)1
[L751]  CALL         1  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L751]  RET          1  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L752]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L753]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L754]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L755]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L756]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L759]               1  __unbuffered_p0_EAX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L776]               2  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L779]               2  __unbuffered_p1_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L782]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L783]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L784]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L785]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L786]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L789]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L791]               2  return 0;
[L796]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L799]               3  __unbuffered_p2_EAX = y
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L802]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L803]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L804]               3  z$flush_delayed = weak$$choice2
[L805]               3  z$mem_tmp = z
[L806]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L807]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L808]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L809]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L810]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L811]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L812]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L813]               3  __unbuffered_p2_EBX = z
[L814]               3  z = z$flush_delayed ? z$mem_tmp : z
[L815]               3  z$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L818]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L819]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L820]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L821]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L822]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L825]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L827]               3  return 0;
[L762]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L763]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L764]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L765]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L766]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L769]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L847]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L849]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L849]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L851]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L852]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L853]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L854]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L855]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L858]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t409=-3, t410=-2, t411=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L860]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 845]: 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: 841]: 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: 843]: 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: ULTIMATE.start with 1 thread instances
    CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 279.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 226.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 46, 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.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 49.3s, ConditionalCommutativityCheckTime: 49.3s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 1, ConditionalCommutativityConditionCalculations: 17, ConditionalCommutativityTraceChecks: 10, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-16 12:47:31,209 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-10-16 12:47:31,380 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...