/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 14:39:05,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 14:39:05,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 14:39:05,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 14:39:05,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 14:39:05,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 14:39:05,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 14:39:05,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 14:39:05,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 14:39:05,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 14:39:05,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 14:39:05,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 14:39:05,304 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 14:39:05,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 14:39:05,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 14:39:05,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 14:39:05,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 14:39:05,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 14:39:05,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 14:39:05,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 14:39:05,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 14:39:05,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 14:39:05,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 14:39:05,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 14:39:05,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 14:39:05,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 14:39:05,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 14:39:05,308 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 14:39:05,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 14:39:05,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:39:05,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 14:39:05,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 14:39:05,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 14:39:05,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 14:39:05,310 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 14:39:05,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 14:39:05,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 14:39:05,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 14:39:05,311 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 14:39:05,311 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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS 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: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 50 [2024-05-06 14:39:05,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 14:39:05,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 14:39:05,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 14:39:05,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 14:39:05,535 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 14:39:05,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2024-05-06 14:39:06,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 14:39:06,841 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 14:39:06,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2024-05-06 14:39:06,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b1ecd5e2e/4f0face6b5534b099a767f8504bf6277/FLAGe414fce9c [2024-05-06 14:39:06,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b1ecd5e2e/4f0face6b5534b099a767f8504bf6277 [2024-05-06 14:39:06,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 14:39:06,866 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 14:39:06,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 14:39:06,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 14:39:06,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 14:39:06,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:39:06" (1/1) ... [2024-05-06 14:39:06,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1faa5459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:06, skipping insertion in model container [2024-05-06 14:39:06,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 02:39:06" (1/1) ... [2024-05-06 14:39:06,914 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 14:39:07,027 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i[958,971] [2024-05-06 14:39:07,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:39:07,186 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 14:39:07,194 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i[958,971] [2024-05-06 14:39:07,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 14:39:07,295 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:39:07,296 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 14:39:07,301 INFO L206 MainTranslator]: Completed translation [2024-05-06 14:39:07,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07 WrapperNode [2024-05-06 14:39:07,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 14:39:07,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 14:39:07,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 14:39:07,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 14:39:07,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,339 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-05-06 14:39:07,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 14:39:07,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 14:39:07,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 14:39:07,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 14:39:07,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 14:39:07,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 14:39:07,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 14:39:07,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 14:39:07,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (1/1) ... [2024-05-06 14:39:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 14:39:07,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:39:07,422 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-05-06 14:39:07,442 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-05-06 14:39:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 14:39:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 14:39:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 14:39:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 14:39:07,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 14:39:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 14:39:07,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 14:39:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 14:39:07,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 14:39:07,466 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 14:39:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 14:39:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-06 14:39:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-06 14:39:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 14:39:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 14:39:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 14:39:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 14:39:07,469 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 14:39:07,622 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 14:39:07,633 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 14:39:07,938 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 14:39:08,025 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 14:39:08,026 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 14:39:08,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:39:08 BoogieIcfgContainer [2024-05-06 14:39:08,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 14:39:08,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 14:39:08,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 14:39:08,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 14:39:08,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 02:39:06" (1/3) ... [2024-05-06 14:39:08,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb2ce13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:39:08, skipping insertion in model container [2024-05-06 14:39:08,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 02:39:07" (2/3) ... [2024-05-06 14:39:08,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb2ce13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 02:39:08, skipping insertion in model container [2024-05-06 14:39:08,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 02:39:08" (3/3) ... [2024-05-06 14:39:08,035 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2024-05-06 14:39:08,041 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 14:39:08,048 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 14:39:08,048 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 14:39:08,048 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 14:39:08,096 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 14:39:08,133 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 14:39:08,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 14:39:08,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 14:39:08,136 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-05-06 14:39:08,140 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-05-06 14:39:08,179 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 14:39:08,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:08,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 14:39:08,198 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@62a4b423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 14:39:08,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-06 14:39:08,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:08,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash 107322587, now seen corresponding path program 1 times [2024-05-06 14:39:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:08,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679644844] [2024-05-06 14:39:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:09,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679644844] [2024-05-06 14:39:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679644844] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:09,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:09,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 14:39:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779653976] [2024-05-06 14:39:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:09,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 14:39:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 14:39:09,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:39:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:09,041 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:09,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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-05-06 14:39:09,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:39:09,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 14:39:09,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:09,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1776770556, now seen corresponding path program 1 times [2024-05-06 14:39:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776741179] [2024-05-06 14:39:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776741179] [2024-05-06 14:39:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776741179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-06 14:39:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974792631] [2024-05-06 14:39:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-06 14:39:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-06 14:39:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:39:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:09,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:09,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 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-05-06 14:39:09,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:39:09,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash 520417209, now seen corresponding path program 1 times [2024-05-06 14:39:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:10,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:39:10,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:39:10,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 14:39:10,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:39:10,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:39:10,165 INFO L85 PathProgramCache]: Analyzing trace with hash 290984620, now seen corresponding path program 1 times [2024-05-06 14:39:10,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:39:10,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316251104] [2024-05-06 14:39:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:10,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:39:10,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316251104] [2024-05-06 14:39:10,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316251104] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:39:10,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:39:10,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 14:39:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467812504] [2024-05-06 14:39:10,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:39:10,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 14:39:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:39:10,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 14:39:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 14:39:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:10,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:39:10,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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-05-06 14:39:10,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:39:10,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-06 14:39:10,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:39:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 520417209, now seen corresponding path program 2 times [2024-05-06 14:39:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:10,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1630885027, now seen corresponding path program 1 times [2024-05-06 14:39:11,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:11,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:11,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash 822199256, now seen corresponding path program 1 times [2024-05-06 14:39:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:11,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:11,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 851699192, now seen corresponding path program 1 times [2024-05-06 14:39:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:11,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash 858758214, now seen corresponding path program 1 times [2024-05-06 14:39:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 443343913, now seen corresponding path program 1 times [2024-05-06 14:39:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1371171873, now seen corresponding path program 1 times [2024-05-06 14:39:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -44231278, now seen corresponding path program 1 times [2024-05-06 14:39:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1799688515, now seen corresponding path program 1 times [2024-05-06 14:39:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1166433221, now seen corresponding path program 1 times [2024-05-06 14:39:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1284552975, now seen corresponding path program 1 times [2024-05-06 14:39:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:12,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1015352220, now seen corresponding path program 1 times [2024-05-06 14:39:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:13,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash 813426002, now seen corresponding path program 1 times [2024-05-06 14:39:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:13,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1039595331, now seen corresponding path program 1 times [2024-05-06 14:39:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:13,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1274353965, now seen corresponding path program 1 times [2024-05-06 14:39:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1205817743, now seen corresponding path program 1 times [2024-05-06 14:39:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1900765342, now seen corresponding path program 1 times [2024-05-06 14:39:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash -769968950, now seen corresponding path program 1 times [2024-05-06 14:39:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:14,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1825952953, now seen corresponding path program 1 times [2024-05-06 14:39:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1465118958, now seen corresponding path program 1 times [2024-05-06 14:39:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:14,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,106 INFO L85 PathProgramCache]: Analyzing trace with hash 462903994, now seen corresponding path program 1 times [2024-05-06 14:39:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash -677804166, now seen corresponding path program 1 times [2024-05-06 14:39:15,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -609097480, now seen corresponding path program 1 times [2024-05-06 14:39:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:15,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1242172990, now seen corresponding path program 1 times [2024-05-06 14:39:16,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1053425879, now seen corresponding path program 1 times [2024-05-06 14:39:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1634693863, now seen corresponding path program 1 times [2024-05-06 14:39:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash -745468667, now seen corresponding path program 1 times [2024-05-06 14:39:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -439689334, now seen corresponding path program 1 times [2024-05-06 14:39:16,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:16,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1232742494, now seen corresponding path program 1 times [2024-05-06 14:39:16,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:16,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash -652970701, now seen corresponding path program 1 times [2024-05-06 14:39:17,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,103 INFO L85 PathProgramCache]: Analyzing trace with hash 256031106, now seen corresponding path program 1 times [2024-05-06 14:39:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1792856154, now seen corresponding path program 1 times [2024-05-06 14:39:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,381 INFO L85 PathProgramCache]: Analyzing trace with hash -334928626, now seen corresponding path program 1 times [2024-05-06 14:39:17,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:17,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2018816658, now seen corresponding path program 1 times [2024-05-06 14:39:18,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:18,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 211971600, now seen corresponding path program 1 times [2024-05-06 14:39:18,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1378635489, now seen corresponding path program 1 times [2024-05-06 14:39:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1895190569, now seen corresponding path program 1 times [2024-05-06 14:39:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:18,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash -354506744, now seen corresponding path program 1 times [2024-05-06 14:39:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1789679629, now seen corresponding path program 1 times [2024-05-06 14:39:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1743383621, now seen corresponding path program 1 times [2024-05-06 14:39:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1580258727, now seen corresponding path program 1 times [2024-05-06 14:39:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:19,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:22,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1768442585, now seen corresponding path program 1 times [2024-05-06 14:39:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:22,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:23,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1905848262, now seen corresponding path program 1 times [2024-05-06 14:39:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:23,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1864099469, now seen corresponding path program 1 times [2024-05-06 14:39:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:27,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1724046908, now seen corresponding path program 1 times [2024-05-06 14:39:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:27,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1048309885, now seen corresponding path program 1 times [2024-05-06 14:39:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:30,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 14:39:30,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 14:39:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash 520417209, now seen corresponding path program 3 times [2024-05-06 14:39:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:30,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1630885027, now seen corresponding path program 2 times [2024-05-06 14:39:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:30,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 822199256, now seen corresponding path program 2 times [2024-05-06 14:39:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 851699192, now seen corresponding path program 2 times [2024-05-06 14:39:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:31,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash 858758214, now seen corresponding path program 2 times [2024-05-06 14:39:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 443343913, now seen corresponding path program 2 times [2024-05-06 14:39:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1371171873, now seen corresponding path program 2 times [2024-05-06 14:39:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash -44231278, now seen corresponding path program 2 times [2024-05-06 14:39:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:31,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1799688515, now seen corresponding path program 2 times [2024-05-06 14:39:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1166433221, now seen corresponding path program 2 times [2024-05-06 14:39:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1284552975, now seen corresponding path program 2 times [2024-05-06 14:39:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1274353965, now seen corresponding path program 2 times [2024-05-06 14:39:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1205817743, now seen corresponding path program 2 times [2024-05-06 14:39:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1900765342, now seen corresponding path program 2 times [2024-05-06 14:39:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash -769968950, now seen corresponding path program 2 times [2024-05-06 14:39:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1825952953, now seen corresponding path program 2 times [2024-05-06 14:39:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1465118958, now seen corresponding path program 2 times [2024-05-06 14:39:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash 462903994, now seen corresponding path program 2 times [2024-05-06 14:39:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash -677804166, now seen corresponding path program 2 times [2024-05-06 14:39:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:33,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1376788624, now seen corresponding path program 1 times [2024-05-06 14:39:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:54,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:39:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:39:55,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1655396058, now seen corresponding path program 1 times [2024-05-06 14:39:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:39:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:39:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:39:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:39:55,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 14:39:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-05-06 14:40:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1376788624, now seen corresponding path program 2 times [2024-05-06 14:40:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:14,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash 634489161, now seen corresponding path program 1 times [2024-05-06 14:40:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:40:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:40:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:40:39,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:40:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash 855475057, now seen corresponding path program 1 times [2024-05-06 14:41:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:01,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash 830440010, now seen corresponding path program 1 times [2024-05-06 14:41:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:26,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -865099182, now seen corresponding path program 1 times [2024-05-06 14:41:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:35,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:44,902 INFO L85 PathProgramCache]: Analyzing trace with hash 331492822, now seen corresponding path program 1 times [2024-05-06 14:41:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:41:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:41:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:41:44,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:41:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -70330421, now seen corresponding path program 1 times [2024-05-06 14:45:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:19,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:19,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:29,983 INFO L85 PathProgramCache]: Analyzing trace with hash 335235689, now seen corresponding path program 1 times [2024-05-06 14:45:29,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:29,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:29,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash 705518645, now seen corresponding path program 1 times [2024-05-06 14:45:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:42,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1271205720, now seen corresponding path program 1 times [2024-05-06 14:45:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:45:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:45:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:45:53,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:45:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 42319164, now seen corresponding path program 1 times [2024-05-06 14:46:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:05,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:16,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1943561743, now seen corresponding path program 1 times [2024-05-06 14:46:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:16,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:16,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1171820696, now seen corresponding path program 1 times [2024-05-06 14:46:28,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:28,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:39,774 INFO L85 PathProgramCache]: Analyzing trace with hash 595209148, now seen corresponding path program 1 times [2024-05-06 14:46:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:39,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:39,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1131155596, now seen corresponding path program 1 times [2024-05-06 14:46:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:52,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1126252363, now seen corresponding path program 1 times [2024-05-06 14:46:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:52,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash -3224859, now seen corresponding path program 1 times [2024-05-06 14:46:58,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:46:58,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:46:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:46:58,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:46:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2122714349, now seen corresponding path program 2 times [2024-05-06 14:47:32,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:32,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1761335401, now seen corresponding path program 2 times [2024-05-06 14:47:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:39,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -407294505, now seen corresponding path program 2 times [2024-05-06 14:47:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:45,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash 617333080, now seen corresponding path program 2 times [2024-05-06 14:47:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:51,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 727076190, now seen corresponding path program 2 times [2024-05-06 14:47:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:47:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:47:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:47:57,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:47:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -589440497, now seen corresponding path program 2 times [2024-05-06 14:48:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:03,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1114025466, now seen corresponding path program 2 times [2024-05-06 14:48:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:10,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1466985532, now seen corresponding path program 2 times [2024-05-06 14:48:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:15,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash -949025490, now seen corresponding path program 2 times [2024-05-06 14:48:22,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash -791072694, now seen corresponding path program 1 times [2024-05-06 14:48:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1359956882, now seen corresponding path program 1 times [2024-05-06 14:48:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1618696839, now seen corresponding path program 1 times [2024-05-06 14:48:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash -744951335, now seen corresponding path program 1 times [2024-05-06 14:48:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:22,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 530161264, now seen corresponding path program 1 times [2024-05-06 14:48:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:23,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1125481397, now seen corresponding path program 1 times [2024-05-06 14:48:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:23,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:48:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:48:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 14:48:23,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69 [2024-05-06 14:48:23,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:48:23,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:48:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1956850514, now seen corresponding path program 2 times [2024-05-06 14:48:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:48:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546504817] [2024-05-06 14:48:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 14:48:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-06 14:48:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 14:48:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546504817] [2024-05-06 14:48:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546504817] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 14:48:23,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 14:48:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-05-06 14:48:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388501009] [2024-05-06 14:48:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 14:48:23,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-06 14:48:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 14:48:23,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-06 14:48:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-05-06 14:48:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:48:23,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 14:48:23,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 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-05-06 14:48:23,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:48:23,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:48:23,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-06 14:48:23,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:48:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1376788624, now seen corresponding path program 3 times [2024-05-06 14:48:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:24,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 634489161, now seen corresponding path program 2 times [2024-05-06 14:48:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:24,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 855475057, now seen corresponding path program 2 times [2024-05-06 14:48:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:25,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash 830440010, now seen corresponding path program 2 times [2024-05-06 14:48:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:26,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -865099182, now seen corresponding path program 2 times [2024-05-06 14:48:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:27,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1126252363, now seen corresponding path program 2 times [2024-05-06 14:48:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:34,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2122714349, now seen corresponding path program 3 times [2024-05-06 14:48:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:47,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:47,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1761335401, now seen corresponding path program 3 times [2024-05-06 14:48:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:48:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:48:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:48:54,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:48:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -407294505, now seen corresponding path program 3 times [2024-05-06 14:49:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:00,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 617333080, now seen corresponding path program 3 times [2024-05-06 14:49:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:06,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash 727076190, now seen corresponding path program 3 times [2024-05-06 14:49:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:12,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash -589440497, now seen corresponding path program 3 times [2024-05-06 14:49:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:19,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1114025466, now seen corresponding path program 3 times [2024-05-06 14:49:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:25,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1466985532, now seen corresponding path program 3 times [2024-05-06 14:49:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:31,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -949025490, now seen corresponding path program 3 times [2024-05-06 14:49:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:37,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -791072694, now seen corresponding path program 2 times [2024-05-06 14:49:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:37,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1359956882, now seen corresponding path program 2 times [2024-05-06 14:49:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1618696839, now seen corresponding path program 2 times [2024-05-06 14:49:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash -744951335, now seen corresponding path program 2 times [2024-05-06 14:49:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash 530161264, now seen corresponding path program 2 times [2024-05-06 14:49:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1125481397, now seen corresponding path program 2 times [2024-05-06 14:49:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash 867593181, now seen corresponding path program 1 times [2024-05-06 14:49:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -526198743, now seen corresponding path program 1 times [2024-05-06 14:49:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:38,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash 302328064, now seen corresponding path program 1 times [2024-05-06 14:49:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash -960076772, now seen corresponding path program 1 times [2024-05-06 14:49:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash -308063313, now seen corresponding path program 1 times [2024-05-06 14:49:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 544253155, now seen corresponding path program 1 times [2024-05-06 14:49:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,519 INFO L85 PathProgramCache]: Analyzing trace with hash 987390502, now seen corresponding path program 1 times [2024-05-06 14:49:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,631 INFO L85 PathProgramCache]: Analyzing trace with hash 863136063, now seen corresponding path program 1 times [2024-05-06 14:49:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash -526342893, now seen corresponding path program 1 times [2024-05-06 14:49:39,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1368498227, now seen corresponding path program 1 times [2024-05-06 14:49:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:39,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash 469807243, now seen corresponding path program 1 times [2024-05-06 14:49:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2093367089, now seen corresponding path program 1 times [2024-05-06 14:49:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1868644858, now seen corresponding path program 1 times [2024-05-06 14:49:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1030111544, now seen corresponding path program 1 times [2024-05-06 14:49:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash 725968689, now seen corresponding path program 1 times [2024-05-06 14:49:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash -530770220, now seen corresponding path program 1 times [2024-05-06 14:49:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1368355038, now seen corresponding path program 1 times [2024-05-06 14:49:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1895518456, now seen corresponding path program 1 times [2024-05-06 14:49:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:40,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1715796641, now seen corresponding path program 1 times [2024-05-06 14:49:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1717918299, now seen corresponding path program 1 times [2024-05-06 14:49:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1052960368, now seen corresponding path program 1 times [2024-05-06 14:49:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash 797318882, now seen corresponding path program 1 times [2024-05-06 14:49:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -667014073, now seen corresponding path program 1 times [2024-05-06 14:49:41,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1363957502, now seen corresponding path program 1 times [2024-05-06 14:49:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1895660684, now seen corresponding path program 1 times [2024-05-06 14:49:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2017063346, now seen corresponding path program 1 times [2024-05-06 14:49:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:41,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash -467106612, now seen corresponding path program 1 times [2024-05-06 14:49:42,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash 539123408, now seen corresponding path program 1 times [2024-05-06 14:49:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,356 INFO L85 PathProgramCache]: Analyzing trace with hash -398249349, now seen corresponding path program 1 times [2024-05-06 14:49:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash -567034729, now seen corresponding path program 1 times [2024-05-06 14:49:42,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1228637170, now seen corresponding path program 1 times [2024-05-06 14:49:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1900028429, now seen corresponding path program 1 times [2024-05-06 14:49:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2016922079, now seen corresponding path program 1 times [2024-05-06 14:49:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash -212028953, now seen corresponding path program 1 times [2024-05-06 14:49:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:42,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash 841611330, now seen corresponding path program 1 times [2024-05-06 14:49:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash 320147860, now seen corresponding path program 2 times [2024-05-06 14:49:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1334649475, now seen corresponding path program 2 times [2024-05-06 14:49:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1575538827, now seen corresponding path program 2 times [2024-05-06 14:49:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:49:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:49:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:49:43,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:49:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:50:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:50:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-06 14:50:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-06 14:50:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 14:50:19,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable153,SelfDestructingSolverStorable110,SelfDestructingSolverStorable154,SelfDestructingSolverStorable150,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable148,SelfDestructingSolverStorable105,SelfDestructingSolverStorable149,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable144,SelfDestructingSolverStorable145,SelfDestructingSolverStorable146,SelfDestructingSolverStorable147,SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable137,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable162,SelfDestructingSolverStorable163,SelfDestructingSolverStorable120,SelfDestructingSolverStorable164,SelfDestructingSolverStorable121,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable159,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable155,SelfDestructingSolverStorable112,SelfDestructingSolverStorable156,SelfDestructingSolverStorable113,SelfDestructingSolverStorable157,SelfDestructingSolverStorable114,SelfDestructingSolverStorable158 [2024-05-06 14:50:19,940 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-06 14:50:19,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:50:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1573517930, now seen corresponding path program 3 times [2024-05-06 14:50:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:50:19,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743363447] [2024-05-06 14:50:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:50:19,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:50:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:50:19,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:50:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:50:19,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:50:19,974 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:50:19,976 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-06 14:50:19,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-06 14:50:19,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-06 14:50:19,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-06 14:50:19,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-06 14:50:19,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-06 14:50:19,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-06 14:50:19,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2024-05-06 14:50:19,980 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:50:19,984 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:50:19,985 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:50:20,082 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-06 14:50:20,084 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:50:20,085 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:50:20,087 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-06 14:50:20,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:50:20 BasicIcfg [2024-05-06 14:50:20,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:50:20,120 INFO L158 Benchmark]: Toolchain (without parser) took 673254.02ms. Allocated memory was 185.6MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 111.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 953.9MB. Max. memory is 8.0GB. [2024-05-06 14:50:20,120 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 185.6MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:50:20,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.85ms. Allocated memory was 185.6MB in the beginning and 371.2MB in the end (delta: 185.6MB). Free memory was 111.7MB in the beginning and 333.6MB in the end (delta: -222.0MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. [2024-05-06 14:50:20,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.92ms. Allocated memory is still 371.2MB. Free memory was 333.6MB in the beginning and 331.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:50:20,121 INFO L158 Benchmark]: Boogie Preprocessor took 27.62ms. Allocated memory is still 371.2MB. Free memory was 331.1MB in the beginning and 329.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:50:20,121 INFO L158 Benchmark]: RCFGBuilder took 657.94ms. Allocated memory is still 371.2MB. Free memory was 329.0MB in the beginning and 291.7MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2024-05-06 14:50:20,121 INFO L158 Benchmark]: TraceAbstraction took 672091.31ms. Allocated memory was 371.2MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 290.7MB in the beginning and 1.2GB in the end (delta: -883.4MB). Peak memory consumption was 945.8MB. Max. memory is 8.0GB. [2024-05-06 14:50:20,122 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.42ms. Allocated memory is still 185.6MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.85ms. Allocated memory was 185.6MB in the beginning and 371.2MB in the end (delta: 185.6MB). Free memory was 111.7MB in the beginning and 333.6MB in the end (delta: -222.0MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.92ms. Allocated memory is still 371.2MB. Free memory was 333.6MB in the beginning and 331.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.62ms. Allocated memory is still 371.2MB. Free memory was 331.1MB in the beginning and 329.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 657.94ms. Allocated memory is still 371.2MB. Free memory was 329.0MB in the beginning and 291.7MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 672091.31ms. Allocated memory was 371.2MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 290.7MB in the beginning and 1.2GB in the end (delta: -883.4MB). Peak memory consumption was 945.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 858671, independent: 851766, independent conditional: 851722, independent unconditional: 44, dependent: 6905, dependent conditional: 6905, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 858315, independent: 851766, independent conditional: 851722, independent unconditional: 44, dependent: 6549, dependent conditional: 6549, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 858315, independent: 851766, independent conditional: 851722, independent unconditional: 44, dependent: 6549, dependent conditional: 6549, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 858315, independent: 851766, independent conditional: 851722, independent unconditional: 44, dependent: 6549, dependent conditional: 6549, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 886735, independent: 851766, independent conditional: 409063, independent unconditional: 442703, dependent: 34969, dependent conditional: 28276, dependent unconditional: 6693, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 886735, independent: 851766, independent conditional: 236394, independent unconditional: 615372, dependent: 34969, dependent conditional: 7256, dependent unconditional: 27713, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 886735, independent: 851766, independent conditional: 236394, independent unconditional: 615372, dependent: 34969, dependent conditional: 7256, dependent unconditional: 27713, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1797, independent: 1746, independent conditional: 383, independent unconditional: 1363, dependent: 51, dependent conditional: 30, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1797, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 51, dependent conditional: 30, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 51, dependent conditional: 30, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, independent: 96, independent conditional: 91, independent unconditional: 5, dependent: 254, dependent conditional: 173, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 886735, independent: 850020, independent conditional: 236011, independent unconditional: 614009, dependent: 34918, dependent conditional: 7226, dependent unconditional: 27692, unknown: 1797, unknown conditional: 413, unknown unconditional: 1384] , Statistics on independence cache: Total cache size (in pairs): 1797, Positive cache size: 1746, Positive conditional cache size: 383, Positive unconditional cache size: 1363, Negative cache size: 51, Negative conditional cache size: 30, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 193689, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 886735, independent: 851766, independent conditional: 409063, independent unconditional: 442703, dependent: 34969, dependent conditional: 28276, dependent unconditional: 6693, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 886735, independent: 851766, independent conditional: 236394, independent unconditional: 615372, dependent: 34969, dependent conditional: 7256, dependent unconditional: 27713, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 886735, independent: 851766, independent conditional: 236394, independent unconditional: 615372, dependent: 34969, dependent conditional: 7256, dependent unconditional: 27713, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1797, independent: 1746, independent conditional: 383, independent unconditional: 1363, dependent: 51, dependent conditional: 30, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1797, independent: 1700, independent conditional: 0, independent unconditional: 1700, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 51, dependent conditional: 30, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 46, independent conditional: 38, independent unconditional: 8, dependent: 51, dependent conditional: 30, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 350, independent: 96, independent conditional: 91, independent unconditional: 5, dependent: 254, dependent conditional: 173, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 886735, independent: 850020, independent conditional: 236011, independent unconditional: 614009, dependent: 34918, dependent conditional: 7226, dependent unconditional: 27692, unknown: 1797, unknown conditional: 413, unknown unconditional: 1384] , Statistics on independence cache: Total cache size (in pairs): 1797, Positive cache size: 1746, Positive conditional cache size: 383, Positive unconditional cache size: 1363, Negative cache size: 51, Negative conditional cache size: 30, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 193689 ], Independence queries for same thread: 356 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L724] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L725] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L726] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L728] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L731] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L732] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L733] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L734] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L735] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L736] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L737] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y=0] [L738] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y=0] [L739] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L740] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L741] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L742] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y=0] [L743] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y=0] [L744] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L745] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L746] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L747] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L748] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L750] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L751] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L752] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] 0 pthread_t t941; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L865] 0 pthread_t t942; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L867] 0 pthread_t t943; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 0 pthread_t t944; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L832] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L835] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L838] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L850] 4 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 b = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L771] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L794] 2 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L824] 3 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 870]: 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: 866]: 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: 868]: 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 with 1 thread instances CFG has 9 procedures, 175 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 671.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 669.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 2242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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, ConditionalCommutativityCheckTime: 661.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 2, ConditionalCommutativityConditionCalculations: 500, ConditionalCommutativityTraceChecks: 159, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:50:20,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 14:50:20,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...