/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/mix006.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 13:50:18,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 13:50:18,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 13:50:18,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 13:50:18,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 13:50:18,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 13:50:18,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 13:50:18,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 13:50:18,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 13:50:18,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 13:50:18,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 13:50:18,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 13:50:18,659 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 13:50:18,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 13:50:18,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 13:50:18,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 13:50:18,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 13:50:18,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 13:50:18,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 13:50:18,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 13:50:18,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 13:50:18,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 13:50:18,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 13:50:18,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 13:50:18,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 13:50:18,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 13:50:18,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 13:50:18,665 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 13:50:18,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 13:50:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:50:18,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 13:50:18,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 13:50:18,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 13:50:18,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 13:50:18,666 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 13:50:18,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 13:50:18,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 13:50:18,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 13:50:18,667 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 13:50:18,667 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:50:18,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 13:50:18,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 13:50:18,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 13:50:18,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 13:50:18,908 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 13:50:18,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-05-06 13:50:19,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 13:50:20,147 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 13:50:20,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2024-05-06 13:50:20,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a1ec06dc8/820e81d4a1df4e04b144cbf5ff89b7e8/FLAG08ae9e9fb [2024-05-06 13:50:20,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a1ec06dc8/820e81d4a1df4e04b144cbf5ff89b7e8 [2024-05-06 13:50:20,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 13:50:20,179 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 13:50:20,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 13:50:20,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 13:50:20,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 13:50:20,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cf11fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20, skipping insertion in model container [2024-05-06 13:50:20,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 13:50:20,353 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/mix006.opt.i[944,957] [2024-05-06 13:50:20,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:50:20,532 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 13:50:20,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/mix006.opt.i[944,957] [2024-05-06 13:50:20,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 13:50:20,685 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:50:20,686 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 13:50:20,691 INFO L206 MainTranslator]: Completed translation [2024-05-06 13:50:20,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20 WrapperNode [2024-05-06 13:50:20,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 13:50:20,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 13:50:20,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 13:50:20,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 13:50:20,702 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:50:20" (1/1) ... [2024-05-06 13:50:20,718 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:50:20" (1/1) ... [2024-05-06 13:50:20,737 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-05-06 13:50:20,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 13:50:20,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 13:50:20,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 13:50:20,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 13:50:20,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 13:50:20,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 13:50:20,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 13:50:20,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 13:50:20,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (1/1) ... [2024-05-06 13:50:20,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 13:50:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:50:20,798 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:50:20,806 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:50:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 13:50:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 13:50:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 13:50:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 13:50:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 13:50:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 13:50:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 13:50:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 13:50:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 13:50:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 13:50:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 13:50:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 13:50:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 13:50:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 13:50:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 13:50:20,842 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:50:21,027 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 13:50:21,029 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 13:50:21,287 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 13:50:21,430 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 13:50:21,430 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 13:50:21,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:50:21 BoogieIcfgContainer [2024-05-06 13:50:21,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 13:50:21,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 13:50:21,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 13:50:21,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 13:50:21,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 01:50:20" (1/3) ... [2024-05-06 13:50:21,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338102c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:50:21, skipping insertion in model container [2024-05-06 13:50:21,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 01:50:20" (2/3) ... [2024-05-06 13:50:21,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338102c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 01:50:21, skipping insertion in model container [2024-05-06 13:50:21,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 01:50:21" (3/3) ... [2024-05-06 13:50:21,441 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2024-05-06 13:50:21,450 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 13:50:21,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 13:50:21,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-06 13:50:21,459 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 13:50:21,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 13:50:21,560 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 13:50:21,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 13:50:21,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 13:50:21,564 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:50:21,568 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:50:21,599 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 13:50:21,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:21,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 13:50:21,627 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;@5cd29e, 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:50:21,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-06 13:50:21,697 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:50:21,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1680969374, now seen corresponding path program 1 times [2024-05-06 13:50:21,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:21,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249807883] [2024-05-06 13:50:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:22,571 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:50:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249807883] [2024-05-06 13:50:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249807883] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:22,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-06 13:50:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713669136] [2024-05-06 13:50:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 13:50:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 13:50:22,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-05-06 13:50:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:22,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:22,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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:50:22,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:22,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 13:50:22,685 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:50:22,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2145519311, now seen corresponding path program 1 times [2024-05-06 13:50:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301007079] [2024-05-06 13:50:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:23,114 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:50:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301007079] [2024-05-06 13:50:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301007079] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:23,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 13:50:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560932167] [2024-05-06 13:50:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:23,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 13:50:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 13:50:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 13:50:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:23,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:23,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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:50:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:23,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:23,414 INFO L85 PathProgramCache]: Analyzing trace with hash -200686479, now seen corresponding path program 1 times [2024-05-06 13:50:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:23,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:50:23,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 13:50:23,557 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:50:23,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:50:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1395147773, now seen corresponding path program 1 times [2024-05-06 13:50:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:50:23,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501075062] [2024-05-06 13:50:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:23,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:50:23,757 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:50:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:50:23,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501075062] [2024-05-06 13:50:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501075062] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:50:23,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:50:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 13:50:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472626501] [2024-05-06 13:50:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:50:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 13:50:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:50:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 13:50:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 13:50:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:23,759 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:50:23,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:50:23,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:50:23,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 13:50:23,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:50:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -200686479, now seen corresponding path program 2 times [2024-05-06 13:50:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:23,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1857036366, now seen corresponding path program 1 times [2024-05-06 13:50:24,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 566570352, now seen corresponding path program 1 times [2024-05-06 13:50:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1587932124, now seen corresponding path program 1 times [2024-05-06 13:50:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1575244230, now seen corresponding path program 1 times [2024-05-06 13:50:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1750301019, now seen corresponding path program 1 times [2024-05-06 13:50:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash -497727923, now seen corresponding path program 1 times [2024-05-06 13:50:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:24,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,022 INFO L85 PathProgramCache]: Analyzing trace with hash 122491593, now seen corresponding path program 1 times [2024-05-06 13:50:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1104427232, now seen corresponding path program 1 times [2024-05-06 13:50:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1559647319, now seen corresponding path program 1 times [2024-05-06 13:50:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash 503878221, now seen corresponding path program 1 times [2024-05-06 13:50:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -460708203, now seen corresponding path program 1 times [2024-05-06 13:50:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash -783750742, now seen corresponding path program 1 times [2024-05-06 13:50:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1451214996, now seen corresponding path program 1 times [2024-05-06 13:50:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:25,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1559395200, now seen corresponding path program 1 times [2024-05-06 13:50:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 642433630, now seen corresponding path program 1 times [2024-05-06 13:50:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1918938953, now seen corresponding path program 1 times [2024-05-06 13:50:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash -893185167, now seen corresponding path program 1 times [2024-05-06 13:50:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1495208229, now seen corresponding path program 1 times [2024-05-06 13:50:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1295158596, now seen corresponding path program 1 times [2024-05-06 13:50:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 180326661, now seen corresponding path program 1 times [2024-05-06 13:50:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,797 INFO L85 PathProgramCache]: Analyzing trace with hash -409824911, now seen corresponding path program 1 times [2024-05-06 13:50:26,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:26,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:26,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1404822898, now seen corresponding path program 1 times [2024-05-06 13:50:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -307930323, now seen corresponding path program 1 times [2024-05-06 13:50:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash 635280049, now seen corresponding path program 1 times [2024-05-06 13:50:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash -338789693, now seen corresponding path program 1 times [2024-05-06 13:50:27,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1673496645, now seen corresponding path program 1 times [2024-05-06 13:50:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1470036922, now seen corresponding path program 1 times [2024-05-06 13:50:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1987083278, now seen corresponding path program 1 times [2024-05-06 13:50:27,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash -905731864, now seen corresponding path program 1 times [2024-05-06 13:50:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1553237727, now seen corresponding path program 1 times [2024-05-06 13:50:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:27,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash -604293752, now seen corresponding path program 1 times [2024-05-06 13:50:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:28,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:28,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash 534696078, now seen corresponding path program 1 times [2024-05-06 13:50:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:28,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash 643174975, now seen corresponding path program 1 times [2024-05-06 13:50:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:28,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1226178369, now seen corresponding path program 1 times [2024-05-06 13:50:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash -455196106, now seen corresponding path program 1 times [2024-05-06 13:50:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1093694994, now seen corresponding path program 1 times [2024-05-06 13:50:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 35280484, now seen corresponding path program 1 times [2024-05-06 13:50:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1663706149, now seen corresponding path program 1 times [2024-05-06 13:50:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 469309956, now seen corresponding path program 1 times [2024-05-06 13:50:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1231786862, now seen corresponding path program 1 times [2024-05-06 13:50:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:29,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 93420898, now seen corresponding path program 1 times [2024-05-06 13:50:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1798101700, now seen corresponding path program 1 times [2024-05-06 13:50:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1859118567, now seen corresponding path program 1 times [2024-05-06 13:50:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash -752708145, now seen corresponding path program 1 times [2024-05-06 13:50:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1548301561, now seen corresponding path program 1 times [2024-05-06 13:50:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1851060446, now seen corresponding path program 1 times [2024-05-06 13:50:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1168090265, now seen corresponding path program 1 times [2024-05-06 13:50:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1901982415, now seen corresponding path program 1 times [2024-05-06 13:50:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:30,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2113601925, now seen corresponding path program 1 times [2024-05-06 13:50:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:49,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash -348068922, now seen corresponding path program 1 times [2024-05-06 13:50:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:57,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1475574786, now seen corresponding path program 1 times [2024-05-06 13:50:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:50:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:50:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:50:58,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:50:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -688150032, now seen corresponding path program 1 times [2024-05-06 13:51:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:05,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1848714464, now seen corresponding path program 1 times [2024-05-06 13:51:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:05,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1501872274, now seen corresponding path program 1 times [2024-05-06 13:51:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:14,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 78911413, now seen corresponding path program 1 times [2024-05-06 13:51:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:14,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1475531801, now seen corresponding path program 1 times [2024-05-06 13:51:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash -828738381, now seen corresponding path program 1 times [2024-05-06 13:51:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:21,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:30,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1848622747, now seen corresponding path program 1 times [2024-05-06 13:51:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:30,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1273659485, now seen corresponding path program 1 times [2024-05-06 13:51:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:30,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash 78925909, now seen corresponding path program 1 times [2024-05-06 13:51:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:37,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 513103622, now seen corresponding path program 1 times [2024-05-06 13:51:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:37,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash -828646664, now seen corresponding path program 1 times [2024-05-06 13:51:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:44,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2094761731, now seen corresponding path program 1 times [2024-05-06 13:51:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:45,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1273626699, now seen corresponding path program 1 times [2024-05-06 13:51:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -348068941, now seen corresponding path program 1 times [2024-05-06 13:51:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:51:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:51:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:51:52,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:51:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 513208421, now seen corresponding path program 1 times [2024-05-06 13:52:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -833942945, now seen corresponding path program 1 times [2024-05-06 13:52:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1081478873, now seen corresponding path program 1 times [2024-05-06 13:52:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1627680248, now seen corresponding path program 1 times [2024-05-06 13:52:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1194423078, now seen corresponding path program 1 times [2024-05-06 13:52:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash 38530138, now seen corresponding path program 1 times [2024-05-06 13:52:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1109624499, now seen corresponding path program 1 times [2024-05-06 13:52:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1144173946, now seen corresponding path program 1 times [2024-05-06 13:52:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash -240182490, now seen corresponding path program 1 times [2024-05-06 13:52:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -271404664, now seen corresponding path program 1 times [2024-05-06 13:52:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash -147300720, now seen corresponding path program 1 times [2024-05-06 13:52:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1251676303, now seen corresponding path program 1 times [2024-05-06 13:52:00,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:00,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:00,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 652362909, now seen corresponding path program 1 times [2024-05-06 13:52:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,086 INFO L85 PathProgramCache]: Analyzing trace with hash 990875651, now seen corresponding path program 1 times [2024-05-06 13:52:01,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1140345322, now seen corresponding path program 1 times [2024-05-06 13:52:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash -240308381, now seen corresponding path program 1 times [2024-05-06 13:52:01,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1116127203, now seen corresponding path program 1 times [2024-05-06 13:52:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash 987328576, now seen corresponding path program 1 times [2024-05-06 13:52:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1971513560, now seen corresponding path program 1 times [2024-05-06 13:52:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,572 INFO L85 PathProgramCache]: Analyzing trace with hash -906232791, now seen corresponding path program 1 times [2024-05-06 13:52:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1633337573, now seen corresponding path program 1 times [2024-05-06 13:52:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1022519995, now seen corresponding path program 1 times [2024-05-06 13:52:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash -244107214, now seen corresponding path program 1 times [2024-05-06 13:52:01,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1116252133, now seen corresponding path program 1 times [2024-05-06 13:52:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:01,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1072373861, now seen corresponding path program 1 times [2024-05-06 13:52:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1298688393, now seen corresponding path program 1 times [2024-05-06 13:52:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -235199889, now seen corresponding path program 1 times [2024-05-06 13:52:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 962245554, now seen corresponding path program 1 times [2024-05-06 13:52:02,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1693611068, now seen corresponding path program 1 times [2024-05-06 13:52:02,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash -361009020, now seen corresponding path program 1 times [2024-05-06 13:52:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1120021175, now seen corresponding path program 1 times [2024-05-06 13:52:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1072249892, now seen corresponding path program 1 times [2024-05-06 13:52:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 588781372, now seen corresponding path program 1 times [2024-05-06 13:52:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1579487777, now seen corresponding path program 1 times [2024-05-06 13:52:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:02,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1764309864, now seen corresponding path program 1 times [2024-05-06 13:52:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:09,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -918878505, now seen corresponding path program 1 times [2024-05-06 13:52:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:10,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:16,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1721031326, now seen corresponding path program 1 times [2024-05-06 13:52:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:16,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:16,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1910022730, now seen corresponding path program 1 times [2024-05-06 13:52:16,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:16,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:16,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1580819793, now seen corresponding path program 1 times [2024-05-06 13:52:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:23,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:23,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash 338711204, now seen corresponding path program 1 times [2024-05-06 13:52:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:23,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash -916035797, now seen corresponding path program 1 times [2024-05-06 13:52:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:31,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1235999460, now seen corresponding path program 1 times [2024-05-06 13:52:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:31,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1910471587, now seen corresponding path program 1 times [2024-05-06 13:52:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:38,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1068510641, now seen corresponding path program 1 times [2024-05-06 13:52:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:38,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 341553912, now seen corresponding path program 1 times [2024-05-06 13:52:45,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:45,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 588658364, now seen corresponding path program 1 times [2024-05-06 13:52:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:45,856 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1234983613, now seen corresponding path program 1 times [2024-05-06 13:52:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:52,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash -812291676, now seen corresponding path program 1 times [2024-05-06 13:52:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:52,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1071758891, now seen corresponding path program 1 times [2024-05-06 13:52:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1771707393, now seen corresponding path program 1 times [2024-05-06 13:52:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -911645302, now seen corresponding path program 1 times [2024-05-06 13:52:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:52:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:52:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:52:59,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:52:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1803767091, now seen corresponding path program 2 times [2024-05-06 13:53:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash 82205355, now seen corresponding path program 2 times [2024-05-06 13:53:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1746600908, now seen corresponding path program 2 times [2024-05-06 13:53:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1689947084, now seen corresponding path program 2 times [2024-05-06 13:53:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1442625213, now seen corresponding path program 1 times [2024-05-06 13:53:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1771709006, now seen corresponding path program 1 times [2024-05-06 13:53:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,544 INFO L85 PathProgramCache]: Analyzing trace with hash -911595281, now seen corresponding path program 2 times [2024-05-06 13:53:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1805317743, now seen corresponding path program 2 times [2024-05-06 13:53:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash 130275568, now seen corresponding path program 2 times [2024-05-06 13:53:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,780 INFO L85 PathProgramCache]: Analyzing trace with hash -256424304, now seen corresponding path program 2 times [2024-05-06 13:53:00,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:00,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1630460663, now seen corresponding path program 1 times [2024-05-06 13:53:18,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:18,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash -882329379, now seen corresponding path program 1 times [2024-05-06 13:53:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:36,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -27180238, now seen corresponding path program 1 times [2024-05-06 13:53:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:53:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:53:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:53:58,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:53:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1245001430, now seen corresponding path program 1 times [2024-05-06 13:54:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:17,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1484217796, now seen corresponding path program 1 times [2024-05-06 13:54:34,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:34,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1713277111, now seen corresponding path program 1 times [2024-05-06 13:54:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:54:56,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:54:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:54:56,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:54:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash 471833508, now seen corresponding path program 1 times [2024-05-06 13:55:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:13,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash -812845142, now seen corresponding path program 1 times [2024-05-06 13:55:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:33,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:55:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:55:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 13:55:34,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable9,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable137,SelfDestructingSolverStorable44,SelfDestructingSolverStorable138,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable133,SelfDestructingSolverStorable48,SelfDestructingSolverStorable134,SelfDestructingSolverStorable49,SelfDestructingSolverStorable135,SelfDestructingSolverStorable136,SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable98,SelfDestructingSolverStorable11,SelfDestructingSolverStorable99,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable110,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable76,SelfDestructingSolverStorable104,SelfDestructingSolverStorable77,SelfDestructingSolverStorable105,SelfDestructingSolverStorable78,SelfDestructingSolverStorable106,SelfDestructingSolverStorable79,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable82,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89,SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable126,SelfDestructingSolverStorable55,SelfDestructingSolverStorable127,SelfDestructingSolverStorable56,SelfDestructingSolverStorable128,SelfDestructingSolverStorable57,SelfDestructingSolverStorable129,SelfDestructingSolverStorable58,SelfDestructingSolverStorable122,SelfDestructingSolverStorable59,SelfDestructingSolverStorable123,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125,SelfDestructingSolverStorable120,SelfDestructingSolverStorable60,SelfDestructingSolverStorable121,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable119,SelfDestructingSolverStorable65,SelfDestructingSolverStorable115,SelfDestructingSolverStorable66,SelfDestructingSolverStorable116,SelfDestructingSolverStorable67,SelfDestructingSolverStorable117,SelfDestructingSolverStorable68,SelfDestructingSolverStorable118,SelfDestructingSolverStorable69,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-06 13:55:34,134 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:55:34,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 13:55:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1379502369, now seen corresponding path program 2 times [2024-05-06 13:55:34,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 13:55:34,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007836090] [2024-05-06 13:55:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 13:55:34,895 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:55:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 13:55:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007836090] [2024-05-06 13:55:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007836090] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 13:55:34,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 13:55:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-06 13:55:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871749670] [2024-05-06 13:55:34,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 13:55:34,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-06 13:55:34,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 13:55:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-06 13:55:34,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-06 13:55:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:55:34,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 13:55:34,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-06 13:55:34,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-06 13:55:34,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 13:55:34,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 13:55:34,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 13:55:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2113601925, now seen corresponding path program 2 times [2024-05-06 13:55:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:55:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:55:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:55:53,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:55:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:00,003 INFO L85 PathProgramCache]: Analyzing trace with hash -348068922, now seen corresponding path program 2 times [2024-05-06 13:56:00,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:00,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:06,651 INFO L85 PathProgramCache]: Analyzing trace with hash -688150032, now seen corresponding path program 2 times [2024-05-06 13:56:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:06,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:06,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1501872274, now seen corresponding path program 2 times [2024-05-06 13:56:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:13,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:13,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1475531801, now seen corresponding path program 2 times [2024-05-06 13:56:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:19,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1848622747, now seen corresponding path program 2 times [2024-05-06 13:56:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:25,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash 78925909, now seen corresponding path program 2 times [2024-05-06 13:56:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:31,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -828646664, now seen corresponding path program 2 times [2024-05-06 13:56:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:36,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1273626699, now seen corresponding path program 2 times [2024-05-06 13:56:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:43,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:43,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash 513208421, now seen corresponding path program 2 times [2024-05-06 13:56:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:49,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1764309864, now seen corresponding path program 2 times [2024-05-06 13:56:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:56:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:56:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:56:55,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:56:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:01,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1721031326, now seen corresponding path program 2 times [2024-05-06 13:57:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:01,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:01,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1580819793, now seen corresponding path program 2 times [2024-05-06 13:57:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:07,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -916035797, now seen corresponding path program 2 times [2024-05-06 13:57:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:13,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1910471587, now seen corresponding path program 2 times [2024-05-06 13:57:19,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:19,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 341553912, now seen corresponding path program 2 times [2024-05-06 13:57:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:26,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1234983613, now seen corresponding path program 2 times [2024-05-06 13:57:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:31,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1071758891, now seen corresponding path program 2 times [2024-05-06 13:57:37,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:37,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:37,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1630460663, now seen corresponding path program 2 times [2024-05-06 13:57:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:57:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:57:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:57:56,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:57:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:14,149 INFO L85 PathProgramCache]: Analyzing trace with hash -882329379, now seen corresponding path program 2 times [2024-05-06 13:58:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:14,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash -27180238, now seen corresponding path program 2 times [2024-05-06 13:58:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:29,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:44,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1245001430, now seen corresponding path program 2 times [2024-05-06 13:58:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:58:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:58:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:58:44,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:58:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1484217796, now seen corresponding path program 2 times [2024-05-06 13:59:01,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:01,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:01,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1713277111, now seen corresponding path program 2 times [2024-05-06 13:59:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:15,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 471833508, now seen corresponding path program 2 times [2024-05-06 13:59:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:29,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash -812845142, now seen corresponding path program 2 times [2024-05-06 13:59:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:46,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1755600208, now seen corresponding path program 3 times [2024-05-06 13:59:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 13:59:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 13:59:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 13:59:55,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 13:59:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -285672910, now seen corresponding path program 3 times [2024-05-06 14:00:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:01,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 169074407, now seen corresponding path program 3 times [2024-05-06 14:00:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:07,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1154630075, now seen corresponding path program 3 times [2024-05-06 14:00:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:13,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:19,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1497887701, now seen corresponding path program 3 times [2024-05-06 14:00:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:19,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2462952, now seen corresponding path program 3 times [2024-05-06 14:00:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:25,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-06 14:00:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 14:00:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 14:00:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 14:00:25,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable153,SelfDestructingSolverStorable154,SelfDestructingSolverStorable170,SelfDestructingSolverStorable171,SelfDestructingSolverStorable150,SelfDestructingSolverStorable148,SelfDestructingSolverStorable149,SelfDestructingSolverStorable144,SelfDestructingSolverStorable166,SelfDestructingSolverStorable145,SelfDestructingSolverStorable167,SelfDestructingSolverStorable146,SelfDestructingSolverStorable168,SelfDestructingSolverStorable147,SelfDestructingSolverStorable169,SelfDestructingSolverStorable140,SelfDestructingSolverStorable162,SelfDestructingSolverStorable141,SelfDestructingSolverStorable163,SelfDestructingSolverStorable142,SelfDestructingSolverStorable164,SelfDestructingSolverStorable143,SelfDestructingSolverStorable165,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable159,SelfDestructingSolverStorable139,SelfDestructingSolverStorable155,SelfDestructingSolverStorable156,SelfDestructingSolverStorable157,SelfDestructingSolverStorable158 [2024-05-06 14:00:25,762 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:00:25,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 14:00:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1162557279, now seen corresponding path program 3 times [2024-05-06 14:00:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 14:00:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965911242] [2024-05-06 14:00:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 14:00:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 14:00:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:25,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 14:00:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 14:00:25,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-06 14:00:25,796 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-06 14:00:25,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-05-06 14:00:25,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-06 14:00:25,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-05-06 14:00:25,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-05-06 14:00:25,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-05-06 14:00:25,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-06 14:00:25,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2024-05-06 14:00:25,806 INFO L448 BasicCegarLoop]: Path program histogram: [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 14:00:25,810 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 14:00:25,810 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 14:00:25,893 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-06 14:00:25,895 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-06 14:00:25,895 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-06 14:00:25,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 02:00:25 BasicIcfg [2024-05-06 14:00:25,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 14:00:25,929 INFO L158 Benchmark]: Toolchain (without parser) took 605750.21ms. Allocated memory was 303.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 231.3MB in the beginning and 788.3MB in the end (delta: -557.0MB). Peak memory consumption was 879.5MB. Max. memory is 8.0GB. [2024-05-06 14:00:25,930 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 14:00:25,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.50ms. Allocated memory is still 303.0MB. Free memory was 231.1MB in the beginning and 263.6MB in the end (delta: -32.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-05-06 14:00:25,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.47ms. Allocated memory is still 303.0MB. Free memory was 263.6MB in the beginning and 260.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:00:25,930 INFO L158 Benchmark]: Boogie Preprocessor took 22.59ms. Allocated memory is still 303.0MB. Free memory was 260.9MB in the beginning and 258.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 14:00:25,930 INFO L158 Benchmark]: RCFGBuilder took 671.40ms. Allocated memory is still 303.0MB. Free memory was 258.8MB in the beginning and 219.5MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2024-05-06 14:00:25,931 INFO L158 Benchmark]: TraceAbstraction took 604494.90ms. Allocated memory was 303.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 218.5MB in the beginning and 788.3MB in the end (delta: -569.8MB). Peak memory consumption was 866.7MB. Max. memory is 8.0GB. [2024-05-06 14:00:25,931 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.50ms. Allocated memory is still 303.0MB. Free memory was 231.1MB in the beginning and 263.6MB in the end (delta: -32.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.47ms. Allocated memory is still 303.0MB. Free memory was 263.6MB in the beginning and 260.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.59ms. Allocated memory is still 303.0MB. Free memory was 260.9MB in the beginning and 258.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 671.40ms. Allocated memory is still 303.0MB. Free memory was 258.8MB in the beginning and 219.5MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 604494.90ms. Allocated memory was 303.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 218.5MB in the beginning and 788.3MB in the end (delta: -569.8MB). Peak memory consumption was 866.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: 88031, independent: 86778, independent conditional: 86731, independent unconditional: 47, dependent: 1253, dependent conditional: 1253, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87972, independent: 86778, independent conditional: 86731, independent unconditional: 47, dependent: 1194, dependent conditional: 1194, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87972, independent: 86778, independent conditional: 86731, independent unconditional: 47, dependent: 1194, dependent conditional: 1194, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87972, independent: 86778, independent conditional: 86731, independent unconditional: 47, dependent: 1194, dependent conditional: 1194, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91073, independent: 86778, independent conditional: 41014, independent unconditional: 45764, dependent: 4295, dependent conditional: 3067, dependent unconditional: 1228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91073, independent: 86778, independent conditional: 20891, independent unconditional: 65887, dependent: 4295, dependent conditional: 819, dependent unconditional: 3476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91073, independent: 86778, independent conditional: 20891, independent unconditional: 65887, dependent: 4295, dependent conditional: 819, dependent unconditional: 3476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1073, independent: 1041, independent conditional: 203, independent unconditional: 838, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 55, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, independent: 46, independent conditional: 43, independent unconditional: 4, dependent: 254, dependent conditional: 167, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 91073, independent: 85737, independent conditional: 20688, independent unconditional: 65049, dependent: 4263, dependent conditional: 804, dependent unconditional: 3459, unknown: 1073, unknown conditional: 218, unknown unconditional: 855] , Statistics on independence cache: Total cache size (in pairs): 1073, Positive cache size: 1041, Positive conditional cache size: 203, Positive unconditional cache size: 838, Negative cache size: 32, Negative conditional cache size: 15, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22371, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91073, independent: 86778, independent conditional: 41014, independent unconditional: 45764, dependent: 4295, dependent conditional: 3067, dependent unconditional: 1228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91073, independent: 86778, independent conditional: 20891, independent unconditional: 65887, dependent: 4295, dependent conditional: 819, dependent unconditional: 3476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91073, independent: 86778, independent conditional: 20891, independent unconditional: 65887, dependent: 4295, dependent conditional: 819, dependent unconditional: 3476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1073, independent: 1041, independent conditional: 203, independent unconditional: 838, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1073, independent: 1018, independent conditional: 0, independent unconditional: 1018, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 55, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 32, dependent conditional: 15, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, independent: 46, independent conditional: 43, independent unconditional: 4, dependent: 254, dependent conditional: 167, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 91073, independent: 85737, independent conditional: 20688, independent unconditional: 65049, dependent: 4263, dependent conditional: 804, dependent unconditional: 3459, unknown: 1073, unknown conditional: 218, unknown unconditional: 855] , Statistics on independence cache: Total cache size (in pairs): 1073, Positive cache size: 1041, Positive conditional cache size: 203, Positive unconditional cache size: 838, Negative cache size: 32, Negative conditional cache size: 15, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22371 ], Independence queries for same thread: 59 - 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L713] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y=0] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t156; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t157; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t158; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L788] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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, 144 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 604.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 601.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 1291 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: 599.7s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 350, ConditionalCommutativityTraceChecks: 168, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-06 14:00:25,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-06 14:00:26,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...