/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/mix010.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 13:57:40,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 13:57:40,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 13:57:40,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 13:57:40,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 13:57:40,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 13:57:40,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 13:57:40,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 13:57:40,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 13:57:40,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 13:57:40,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 13:57:40,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 13:57:40,541 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 13:57:40,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 13:57:40,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 13:57:40,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 13:57:40,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 13:57:40,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 13:57:40,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 13:57:40,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 13:57:40,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 13:57:40,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 13:57:40,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 13:57:40,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 13:57:40,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 13:57:40,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 13:57:40,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 13:57:40,544 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 13:57:40,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 13:57:40,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:57:40,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 13:57:40,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 13:57:40,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 13:57:40,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 13:57:40,545 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 13:57:40,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 13:57:40,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 13:57:40,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 13:57:40,546 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 13:57:40,546 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 13:57:40,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 13:57:40,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 13:57:40,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 13:57:40,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 13:57:40,766 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 13:57:40,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2024-05-06 13:57:41,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 13:57:42,105 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 13:57:42,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i [2024-05-06 13:57:42,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d218b0291/39708c345767449789bb7e34d0da5299/FLAG07b68f950 [2024-05-06 13:57:42,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d218b0291/39708c345767449789bb7e34d0da5299 [2024-05-06 13:57:42,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 13:57:42,132 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 13:57:42,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 13:57:42,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 13:57:42,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 13:57:42,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a99257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42, skipping insertion in model container [2024-05-06 13:57:42,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,186 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 13:57:42,321 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/mix010.opt.i[944,957] [2024-05-06 13:57:42,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:57:42,532 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 13:57:42,542 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/mix010.opt.i[944,957] [2024-05-06 13:57:42,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:57:42,629 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:57:42,629 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:57:42,634 INFO L206 MainTranslator]: Completed translation [2024-05-06 13:57:42,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42 WrapperNode [2024-05-06 13:57:42,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 13:57:42,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 13:57:42,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 13:57:42,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 13:57:42,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,691 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-05-06 13:57:42,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 13:57:42,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 13:57:42,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 13:57:42,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 13:57:42,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 13:57:42,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 13:57:42,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 13:57:42,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 13:57:42,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (1/1) ... [2024-05-06 13:57:42,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:57:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:57:42,759 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 13:57:42,798 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 13:57:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 13:57:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 13:57:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 13:57:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 13:57:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 13:57:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 13:57:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 13:57:42,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 13:57:42,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 13:57:42,822 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 13:57:42,980 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 13:57:42,982 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 13:57:43,258 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 13:57:43,365 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 13:57:43,365 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 13:57:43,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:57:43 BoogieIcfgContainer [2024-05-06 13:57:43,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 13:57:43,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 13:57:43,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 13:57:43,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 13:57:43,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:57:42" (1/3) ... [2024-05-06 13:57:43,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd5f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:57:43, skipping insertion in model container [2024-05-06 13:57:43,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:57:42" (2/3) ... [2024-05-06 13:57:43,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd5f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:57:43, skipping insertion in model container [2024-05-06 13:57:43,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:57:43" (3/3) ... [2024-05-06 13:57:43,378 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2024-05-06 13:57:43,386 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 13:57:43,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 13:57:43,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 13:57:43,394 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 13:57:43,453 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 13:57:43,493 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 13:57:43,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 13:57:43,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:57:43,496 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 13:57:43,508 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 13:57:43,542 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 13:57:43,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:57:43,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 13:57:43,559 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;@6c09637, 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 13:57:43,560 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 13:57:43,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:57:43,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:57:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 276989238, now seen corresponding path program 1 times [2024-05-06 13:57:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:57:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718387896] [2024-05-06 13:57:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:57:44,342 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 13:57:44,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:57:44,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718387896] [2024-05-06 13:57:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718387896] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:57:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:57:44,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 13:57:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178176342] [2024-05-06 13:57:44,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:57:44,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-06 13:57:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:57:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-06 13:57:44,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-06 13:57:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:44,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:57:44,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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 13:57:44,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:57:44,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 13:57:44,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:57:44,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:57:44,470 INFO L85 PathProgramCache]: Analyzing trace with hash -522648562, now seen corresponding path program 1 times [2024-05-06 13:57:44,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:57:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28481901] [2024-05-06 13:57:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:57:44,981 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 13:57:44,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:57:44,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28481901] [2024-05-06 13:57:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28481901] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:57:44,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:57:44,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 13:57:44,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330123359] [2024-05-06 13:57:44,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:57:44,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 13:57:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:57:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 13:57:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 13:57:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:44,986 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:57:44,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 13:57:44,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:57:44,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1902175746, now seen corresponding path program 1 times [2024-05-06 13:57:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:45,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:57:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:57:45,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 13:57:45,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:57:45,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:57:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1010197960, now seen corresponding path program 1 times [2024-05-06 13:57:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:57:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939580149] [2024-05-06 13:57:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:57:45,705 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 13:57:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:57:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939580149] [2024-05-06 13:57:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939580149] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:57:45,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:57:45,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 13:57:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963792948] [2024-05-06 13:57:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:57:45,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 13:57:45,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:57:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 13:57:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 13:57:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:45,707 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:57:45,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:57:45,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:57:45,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:57:45,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:57:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1902175746, now seen corresponding path program 2 times [2024-05-06 13:57:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:45,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1629591570, now seen corresponding path program 1 times [2024-05-06 13:57:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -306061283, now seen corresponding path program 1 times [2024-05-06 13:57:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2041398523, now seen corresponding path program 1 times [2024-05-06 13:57:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash -349790375, now seen corresponding path program 1 times [2024-05-06 13:57:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash -704020175, now seen corresponding path program 1 times [2024-05-06 13:57:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash -992541618, now seen corresponding path program 1 times [2024-05-06 13:57:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:46,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1492003265, now seen corresponding path program 1 times [2024-05-06 13:57:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1433602466, now seen corresponding path program 1 times [2024-05-06 13:57:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1154623923, now seen corresponding path program 1 times [2024-05-06 13:57:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash -101301308, now seen corresponding path program 1 times [2024-05-06 13:57:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2077829101, now seen corresponding path program 1 times [2024-05-06 13:57:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1619431491, now seen corresponding path program 1 times [2024-05-06 13:57:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -860578356, now seen corresponding path program 1 times [2024-05-06 13:57:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1717267092, now seen corresponding path program 1 times [2024-05-06 13:57:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash 498793672, now seen corresponding path program 1 times [2024-05-06 13:57:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1540110818, now seen corresponding path program 1 times [2024-05-06 13:57:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash -227413635, now seen corresponding path program 1 times [2024-05-06 13:57:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1531356494, now seen corresponding path program 1 times [2024-05-06 13:57:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1711966575, now seen corresponding path program 1 times [2024-05-06 13:57:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1025056028, now seen corresponding path program 1 times [2024-05-06 13:57:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -725802893, now seen corresponding path program 1 times [2024-05-06 13:57:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:48,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2015947361, now seen corresponding path program 1 times [2024-05-06 13:57:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,334 INFO L85 PathProgramCache]: Analyzing trace with hash 656090193, now seen corresponding path program 1 times [2024-05-06 13:57:49,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1168748546, now seen corresponding path program 1 times [2024-05-06 13:57:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1865755398, now seen corresponding path program 1 times [2024-05-06 13:57:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash -198732934, now seen corresponding path program 1 times [2024-05-06 13:57:49,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1794704624, now seen corresponding path program 1 times [2024-05-06 13:57:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1743221585, now seen corresponding path program 1 times [2024-05-06 13:57:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -887516864, now seen corresponding path program 1 times [2024-05-06 13:57:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 109917763, now seen corresponding path program 1 times [2024-05-06 13:57:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1520474894, now seen corresponding path program 1 times [2024-05-06 13:57:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1018878811, now seen corresponding path program 1 times [2024-05-06 13:57:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:50,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 734612939, now seen corresponding path program 1 times [2024-05-06 13:57:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1409170569, now seen corresponding path program 1 times [2024-05-06 13:57:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -231637503, now seen corresponding path program 1 times [2024-05-06 13:57:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash 408169854, now seen corresponding path program 1 times [2024-05-06 13:57:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash 428808849, now seen corresponding path program 1 times [2024-05-06 13:57:51,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -678904110, now seen corresponding path program 1 times [2024-05-06 13:57:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1684468093, now seen corresponding path program 1 times [2024-05-06 13:57:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1331135732, now seen corresponding path program 1 times [2024-05-06 13:57:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:51,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1345444089, now seen corresponding path program 1 times [2024-05-06 13:57:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash 736138139, now seen corresponding path program 1 times [2024-05-06 13:57:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1409219759, now seen corresponding path program 1 times [2024-05-06 13:57:52,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:52,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1062919920, now seen corresponding path program 1 times [2024-05-06 13:57:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -865571649, now seen corresponding path program 1 times [2024-05-06 13:57:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:52,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1136300316, now seen corresponding path program 1 times [2024-05-06 13:57:52,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:52,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:52,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:53,067 INFO L85 PathProgramCache]: Analyzing trace with hash 794629169, now seen corresponding path program 1 times [2024-05-06 13:57:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:53,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -112914042, now seen corresponding path program 1 times [2024-05-06 13:57:53,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:53,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash -758948454, now seen corresponding path program 1 times [2024-05-06 13:57:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:57:54,577 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 13:57:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:57:54,632 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 13:57:54,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-06 13:57:54,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-06 13:57:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1902175746, now seen corresponding path program 3 times [2024-05-06 13:57:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:54,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1629591570, now seen corresponding path program 2 times [2024-05-06 13:57:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:54,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -306061283, now seen corresponding path program 2 times [2024-05-06 13:57:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2041398523, now seen corresponding path program 2 times [2024-05-06 13:57:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash -349790375, now seen corresponding path program 2 times [2024-05-06 13:57:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash -704020175, now seen corresponding path program 2 times [2024-05-06 13:57:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -992541618, now seen corresponding path program 2 times [2024-05-06 13:57:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1492003265, now seen corresponding path program 2 times [2024-05-06 13:57:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1433602466, now seen corresponding path program 2 times [2024-05-06 13:57:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:55,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1154623923, now seen corresponding path program 2 times [2024-05-06 13:57:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash -101301308, now seen corresponding path program 2 times [2024-05-06 13:57:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1717267092, now seen corresponding path program 2 times [2024-05-06 13:57:56,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 498793672, now seen corresponding path program 2 times [2024-05-06 13:57:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2052565208, now seen corresponding path program 1 times [2024-05-06 13:58:18,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:18,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:18,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1125163639, now seen corresponding path program 1 times [2024-05-06 13:58:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:26,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:36,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1533697501, now seen corresponding path program 1 times [2024-05-06 13:58:36,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:36,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:36,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1474481155, now seen corresponding path program 1 times [2024-05-06 13:58:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:44,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash -324602797, now seen corresponding path program 1 times [2024-05-06 13:58:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:50,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:58,824 INFO L85 PathProgramCache]: Analyzing trace with hash -564615182, now seen corresponding path program 1 times [2024-05-06 13:58:58,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:58,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:58,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -572311389, now seen corresponding path program 1 times [2024-05-06 13:59:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:07,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash -849727354, now seen corresponding path program 1 times [2024-05-06 13:59:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:15,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1828490283, now seen corresponding path program 1 times [2024-05-06 13:59:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:23,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1049494120, now seen corresponding path program 1 times [2024-05-06 13:59:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:31,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:31,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1307541340, now seen corresponding path program 1 times [2024-05-06 13:59:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:31,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1897485994, now seen corresponding path program 1 times [2024-05-06 13:59:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1446684334, now seen corresponding path program 1 times [2024-05-06 13:59:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1754446635, now seen corresponding path program 1 times [2024-05-06 13:59:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash 636144542, now seen corresponding path program 1 times [2024-05-06 13:59:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,325 INFO L85 PathProgramCache]: Analyzing trace with hash -810762623, now seen corresponding path program 1 times [2024-05-06 13:59:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:32,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:59:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:59:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:59:32,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable30,SelfDestructingSolverStorable74,SelfDestructingSolverStorable31,SelfDestructingSolverStorable75,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable76,SelfDestructingSolverStorable33,SelfDestructingSolverStorable77,SelfDestructingSolverStorable34,SelfDestructingSolverStorable78,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable79,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable54,SelfDestructingSolverStorable11,SelfDestructingSolverStorable55,SelfDestructingSolverStorable12,SelfDestructingSolverStorable56,SelfDestructingSolverStorable13,SelfDestructingSolverStorable57,SelfDestructingSolverStorable14,SelfDestructingSolverStorable58,SelfDestructingSolverStorable15,SelfDestructingSolverStorable59,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable20,SelfDestructingSolverStorable64,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable65,SelfDestructingSolverStorable22,SelfDestructingSolverStorable66,SelfDestructingSolverStorable23,SelfDestructingSolverStorable67,SelfDestructingSolverStorable24,SelfDestructingSolverStorable68,SelfDestructingSolverStorable25,SelfDestructingSolverStorable69,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 13:59:32,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 13:59:32,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:59:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1600782792, now seen corresponding path program 2 times [2024-05-06 13:59:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:59:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476559248] [2024-05-06 13:59:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:59:33,407 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 13:59:33,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:59:33,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476559248] [2024-05-06 13:59:33,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476559248] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:59:33,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:59:33,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-06 13:59:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369068901] [2024-05-06 13:59:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:59:33,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-06 13:59:33,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:59:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-06 13:59:33,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-06 13:59:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:59:33,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:59:33,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:59:33,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-06 13:59:33,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:59:33,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 13:59:33,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 14:00:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1125163639, now seen corresponding path program 2 times [2024-05-06 14:00:01,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:01,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1533697501, now seen corresponding path program 2 times [2024-05-06 14:00:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:11,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:20,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1474481155, now seen corresponding path program 2 times [2024-05-06 14:00:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:20,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:20,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash -324602797, now seen corresponding path program 2 times [2024-05-06 14:00:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:30,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -564615182, now seen corresponding path program 2 times [2024-05-06 14:00:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:38,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -572311389, now seen corresponding path program 2 times [2024-05-06 14:00:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:46,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash -849727354, now seen corresponding path program 2 times [2024-05-06 14:00:55,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:55,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1828490283, now seen corresponding path program 2 times [2024-05-06 14:01:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:04,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:04,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1049494120, now seen corresponding path program 2 times [2024-05-06 14:01:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1307541340, now seen corresponding path program 2 times [2024-05-06 14:01:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1897485994, now seen corresponding path program 2 times [2024-05-06 14:01:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:14,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1446684334, now seen corresponding path program 2 times [2024-05-06 14:01:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:14,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1754446635, now seen corresponding path program 2 times [2024-05-06 14:01:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 636144542, now seen corresponding path program 2 times [2024-05-06 14:01:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -810762623, now seen corresponding path program 2 times [2024-05-06 14:01:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 943678828, now seen corresponding path program 1 times [2024-05-06 14:01:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash 446086431, now seen corresponding path program 1 times [2024-05-06 14:01:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash -464325480, now seen corresponding path program 1 times [2024-05-06 14:01:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1954638794, now seen corresponding path program 1 times [2024-05-06 14:01:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:15,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -894335070, now seen corresponding path program 1 times [2024-05-06 14:01:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1356625249, now seen corresponding path program 1 times [2024-05-06 14:01:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -926066286, now seen corresponding path program 1 times [2024-05-06 14:01:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 939958797, now seen corresponding path program 1 times [2024-05-06 14:01:16,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 445964384, now seen corresponding path program 1 times [2024-05-06 14:01:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1122767787, now seen corresponding path program 1 times [2024-05-06 14:01:16,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1828937435, now seen corresponding path program 1 times [2024-05-06 14:01:16,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:16,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:16,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1742119433, now seen corresponding path program 1 times [2024-05-06 14:01:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1190726801, now seen corresponding path program 1 times [2024-05-06 14:01:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -176956428, now seen corresponding path program 1 times [2024-05-06 14:01:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash 825578655, now seen corresponding path program 1 times [2024-05-06 14:01:17,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash 442274144, now seen corresponding path program 1 times [2024-05-06 14:01:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1122646701, now seen corresponding path program 1 times [2024-05-06 14:01:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1903445058, now seen corresponding path program 1 times [2024-05-06 14:01:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:17,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 60366329, now seen corresponding path program 1 times [2024-05-06 14:01:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1106429259, now seen corresponding path program 1 times [2024-05-06 14:01:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1836804797, now seen corresponding path program 1 times [2024-05-06 14:01:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1603317664, now seen corresponding path program 1 times [2024-05-06 14:01:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash 328817523, now seen corresponding path program 1 times [2024-05-06 14:01:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1118986252, now seen corresponding path program 1 times [2024-05-06 14:01:18,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1903565183, now seen corresponding path program 1 times [2024-05-06 14:01:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:18,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:19,073 INFO L85 PathProgramCache]: Analyzing trace with hash 354239850, now seen corresponding path program 1 times [2024-05-06 14:01:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:19,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash -300669530, now seen corresponding path program 1 times [2024-05-06 14:01:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:19,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:19,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -682965363, now seen corresponding path program 1 times [2024-05-06 14:01:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:29,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:29,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash -9696920, now seen corresponding path program 1 times [2024-05-06 14:01:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:30,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -291047089, now seen corresponding path program 1 times [2024-05-06 14:01:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:40,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash 830972976, now seen corresponding path program 1 times [2024-05-06 14:01:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:40,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 543682583, now seen corresponding path program 1 times [2024-05-06 14:01:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:50,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1135185683, now seen corresponding path program 1 times [2024-05-06 14:01:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:01:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:01:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:01:50,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:01:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 671330682, now seen corresponding path program 1 times [2024-05-06 14:02:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:00,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1006453152, now seen corresponding path program 1 times [2024-05-06 14:02:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:01,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1829677689, now seen corresponding path program 1 times [2024-05-06 14:02:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:10,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1907195841, now seen corresponding path program 1 times [2024-05-06 14:02:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:10,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash 624438438, now seen corresponding path program 1 times [2024-05-06 14:02:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:20,189 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-06 14:02:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:02:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 14:02:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:02:20,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable104,SelfDestructingSolverStorable105,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable137,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable133,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable130,SelfDestructingSolverStorable92,SelfDestructingSolverStorable131,SelfDestructingSolverStorable93,SelfDestructingSolverStorable132,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98,SelfDestructingSolverStorable126,SelfDestructingSolverStorable99,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 14:02:20,242 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-06 14:02:20,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:02:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1675548788, now seen corresponding path program 3 times [2024-05-06 14:02:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:02:20,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530754378] [2024-05-06 14:02:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:02:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:02:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:20,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:02:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:02:20,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:02:20,321 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:02:20,322 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 14:02:20,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 14:02:20,323 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 14:02:20,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 14:02:20,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 14:02:20,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 14:02:20,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-05-06 14:02:20,342 INFO L448 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:20,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:02:20,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:02:20,422 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:02:20,424 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:02:20,424 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-06 14:02:20,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:02:20 BasicIcfg [2024-05-06 14:02:20,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:02:20,448 INFO L158 Benchmark]: Toolchain (without parser) took 278316.78ms. Allocated memory was 259.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 185.3MB in the beginning and 1.1GB in the end (delta: -876.6MB). Peak memory consumption was 777.9MB. Max. memory is 8.0GB. [2024-05-06 14:02:20,448 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 259.0MB. Free memory is still 225.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:02:20,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.01ms. Allocated memory is still 259.0MB. Free memory was 185.0MB in the beginning and 160.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-05-06 14:02:20,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.37ms. Allocated memory is still 259.0MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:02:20,450 INFO L158 Benchmark]: Boogie Preprocessor took 32.61ms. Allocated memory is still 259.0MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:02:20,450 INFO L158 Benchmark]: RCFGBuilder took 641.01ms. Allocated memory is still 259.0MB. Free memory was 155.9MB in the beginning and 191.0MB in the end (delta: -35.1MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2024-05-06 14:02:20,450 INFO L158 Benchmark]: TraceAbstraction took 277075.17ms. Allocated memory was 259.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 189.4MB in the beginning and 1.1GB in the end (delta: -872.4MB). Peak memory consumption was 780.7MB. Max. memory is 8.0GB. [2024-05-06 14:02:20,451 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.11ms. Allocated memory is still 259.0MB. Free memory is still 225.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 498.01ms. Allocated memory is still 259.0MB. Free memory was 185.0MB in the beginning and 160.6MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.37ms. Allocated memory is still 259.0MB. Free memory was 160.6MB in the beginning and 158.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.61ms. Allocated memory is still 259.0MB. Free memory was 158.0MB in the beginning and 155.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 641.01ms. Allocated memory is still 259.0MB. Free memory was 155.9MB in the beginning and 191.0MB in the end (delta: -35.1MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * TraceAbstraction took 277075.17ms. Allocated memory was 259.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 189.4MB in the beginning and 1.1GB in the end (delta: -872.4MB). Peak memory consumption was 780.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: 103679, independent: 102732, independent conditional: 102633, independent unconditional: 99, dependent: 947, dependent conditional: 947, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103604, independent: 102732, independent conditional: 102633, independent unconditional: 99, dependent: 872, dependent conditional: 872, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103604, independent: 102732, independent conditional: 102633, independent unconditional: 99, dependent: 872, dependent conditional: 872, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103604, independent: 102732, independent conditional: 102633, independent unconditional: 99, dependent: 872, dependent conditional: 872, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106266, independent: 102732, independent conditional: 48568, independent unconditional: 54164, dependent: 3534, dependent conditional: 2663, dependent unconditional: 871, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106266, independent: 102732, independent conditional: 26734, independent unconditional: 75998, dependent: 3534, dependent conditional: 839, dependent unconditional: 2695, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106266, independent: 102732, independent conditional: 26734, independent unconditional: 75998, dependent: 3534, dependent conditional: 839, dependent unconditional: 2695, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 990, independent: 964, independent conditional: 223, independent unconditional: 741, dependent: 26, dependent conditional: 15, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 990, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 44, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 26, dependent conditional: 15, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 26, dependent conditional: 15, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 280, independent: 24, independent conditional: 19, independent unconditional: 5, dependent: 256, dependent conditional: 203, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 106266, independent: 101768, independent conditional: 26511, independent unconditional: 75257, dependent: 3508, dependent conditional: 824, dependent unconditional: 2684, unknown: 990, unknown conditional: 238, unknown unconditional: 752] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 964, Positive conditional cache size: 223, Positive unconditional cache size: 741, Negative cache size: 26, Negative conditional cache size: 15, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23658, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106266, independent: 102732, independent conditional: 48568, independent unconditional: 54164, dependent: 3534, dependent conditional: 2663, dependent unconditional: 871, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106266, independent: 102732, independent conditional: 26734, independent unconditional: 75998, dependent: 3534, dependent conditional: 839, dependent unconditional: 2695, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106266, independent: 102732, independent conditional: 26734, independent unconditional: 75998, dependent: 3534, dependent conditional: 839, dependent unconditional: 2695, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 990, independent: 964, independent conditional: 223, independent unconditional: 741, dependent: 26, dependent conditional: 15, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 990, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 44, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 26, dependent conditional: 15, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 26, dependent conditional: 15, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 280, independent: 24, independent conditional: 19, independent unconditional: 5, dependent: 256, dependent conditional: 203, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 106266, independent: 101768, independent conditional: 26511, independent unconditional: 75257, dependent: 3508, dependent conditional: 824, dependent unconditional: 2684, unknown: 990, unknown conditional: 238, unknown unconditional: 752] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 964, Positive conditional cache size: 223, Positive unconditional cache size: 741, Negative cache size: 26, Negative conditional cache size: 15, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23658 ], Independence queries for same thread: 75 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L727] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L729] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L730] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0] [L731] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0] [L732] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0] [L733] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0] [L734] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0] [L735] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0] [L740] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z=0] [L741] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0] [L742] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0] [L743] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0] [L744] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0] [L745] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L747] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L853] 0 pthread_t t260; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L855] 0 pthread_t t261; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L857] 0 pthread_t t262; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 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: 858]: 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: 856]: 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: 854]: 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 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 276.8s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 274.1s, 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: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 1345 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: 271.8s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 262, ConditionalCommutativityTraceChecks: 133, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:02:20,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-06 14:02:20,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...